Performing Binary Search Tree Implementation :-

            1
      2           7
 3        4
       5     6

1.Inoerder Traversal : 3,2,5,4,6,1,7
2.Preorder Traversal : 1,2,3,4,5,6,7
3.Postorder Traversal : 3,5,6,4,2,7,1
4.Search Opeartion