BST implementation for the learning purpose:
-
Use of OOP
-
Implementation of all search functionality like inorder search, preorder search and postorder search
-
Method to find minimum and maximum with O(log n) complexity
-
Method to delete element from tree