aman-1998 / binary_search_tree Goto Github PK

Binary_Search_Tree

Binary Search Tree is a node-based binary tree data structure which has the following properties:

• The left subtree of a node contains only nodes with keys lesser than the node’s key.

• The right subtree of a node contains only nodes with keys greater than the node’s key.

• The left and right subtree each must also be a binary search tree.

Functionalites implemented are:-

1.Insert

2.Preorder

3.Inorder

4.Postorder

5.No. of Leaves

6.No. of Halfnode

7.No. of Fullnodes

8.Count total no. of nodes

9.Search

10.isComplete

11.isFull

12.Height

13.Max

14.Min

15.Delete