A binary search tree project to practice DSA.
- Build Tree(array)
- Print Tree(node)
- Insert(value, currentNode)
- Delete(value, currentNode)
- Find(value)
- LevelOrder(callback)
- PreOrder(callback)
- InOrder(callback)
- PostOrder(callback)
- Height(node)
- Depth(node)
- IsBalanced
- Rebalance