/Binary-Search-Tree

Binary search tree and it's functions.

Primary LanguageJava

Binary Search Tree

Implementation of a binary search tree in Java. Includes methods for -

[x] Inserting a node [x] Inorder, pre-order and post-order traversal [x] Finding the height of the tree [x] Searching for an element [x] Deleting an element [x] Finding maximum and minimum element [x] Finding successor of a node [ ] Checking if the tree is symmetric