Download the .java file and run it in your IDE.
This program shows the implementation of Binary search tree. This program supports following BST's operations.
*To insert a value in BST. insert()
*To find a minimum value from BST. minimum()
*To find a maximum value from BST. maximum(),
*To search a value from BST. search(),
*To delete a given value from BST. delete(),
*To disply a value the tree. display()