Introduction to Tree Data Structure:

The Tree is a recursive data structure. A Binary tree consists of a root and two disjoint binary trees called left and right trees. In Binary search tree, every element is distinct and elements in the left subtree are smaller than the root and root is smaller than elements in the right subtree.




The operations on binary search tree are:
1. init (T) – creates an empty Binary search tree by initializing T to NULL
2. insert (T, x) – inserts the value x in the proper position in the Binary search tree
3. search (T, x) – searches if the value x is present in the search tree
4. inOrder (T) – displays the node using inorder traversal of the binary search tree
5. postOrder (T) – displays the node using postorder traversal of the binary search tree
6. preOrder (T) – displays the node using preorder traversal of the binary search tree 


Thanks
Mukesh Rajput
Mukesh Rajput

Mukesh Rajput

I am a Computer Engineer, a small amount of the programming tips as it’s my hobby, I love to travel and meet people so little about travel, a fashion lover and love to eat food, I am investing a good time to keep the body fit so little about fitness also..

Post A Comment:

0 comments:

Thanks
Mukesh Rajput