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, 3 insertions, 1 deletions

diff --git a/src/03/avl_tree_test.c b/src/03/avl_tree_test.c
index 857ae7c..3eb3bec 100644
--- a/src/03/avl_tree_test.c
+++ b/src/03/avl_tree_test.c
@@ -379,15 +379,17 @@ TestSuite *avl_tree_tests() {
   return x;
 }
 
+TestSuite *btree_tests();
 TestSuite *graph_tests();
 TestSuite *matrix_tests();
+TestSuite *meldable_heap_tests();
 TestSuite *rb_tree_tests();
 TestSuite *sort_tests();
-TestSuite *meldable_heap_tests();
 
 int main(int argc, char **argv) {
   TestSuite *suite = create_test_suite();
   add_suite(suite, avl_tree_tests());
+  add_suite(suite, btree_tests());
   add_suite(suite, graph_tests());
   add_suite(suite, matrix_tests());
   add_suite(suite, meldable_heap_tests());