Binary search tree starter code written in ruby
Problems
- Implement and test find
- Implement and test delete
- Implement and test max height (finds the largest path in the tree)
- Implement and test adding values as an array when a new tree is created. Ensure that the tree is balanced when inserting.