feat: prove that height of binary tree is greater than or equal to log2(k) where k is the # of leaves in the tree

1 files changed, 11 insertions, 0 deletions

diff --git a/src/03/btree.h b/src/03/btree.h
new file mode 100644
index 0000000..ab08b9f
--- /dev/null
+++ b/src/03/btree.h
@@ -0,0 +1,11 @@
+typedef struct node {
+  struct node *left;
+  struct node *right;
+  int data;
+} BTree;
+
+BTree *btree_initialize(int data);
+BTree *btree_insert(BTree *tree, int data);
+int btree_height(BTree *tree);
+void btree_inspect(BTree *tree);
+BTree *btree_generate(int leaves);