Implement balanced binary search tree
implemented a binary search tree with minimum height using data in ascending arrays that are integers and have no duplicate values.
implemented a binary search tree with minimum height using data in ascending arrays that are integers and have no duplicate values.
This deals with the type of tree and binary tree traversal.