Uses the Binary Search Tree data structure as a base to implement:
- Counting the number of leaves in BST via recursion
- Check if tree is height balanced via non-tail recursion
Recommended Operating System: Linux
-
Make the files utilising makefile
- make
-
Run the programs
- ./number_of_leaves_test
- ./is_balanced_test
Includes README.md, makefile, BST.h, number_of_leaves_test.cc, and is_balanced_test.cc
makefile, BST.h, number_of_leaves_test.cc, and is_balanced_test.cc are public domain software - free and open source
For any queries please contact Jon Peppinck at [email protected]