Consider a binary search tree (BST) that is initially empty. Draw the tree that will result if the following numbers are inserted in the same order given below:
13, 3,1,2,4,12,10,5,8,7,6,9,11,14,15,18

After making a BST perform the following operations on it.

1. Pre order Traversal 5
2. Inorder Traversal 5
3. Postorder Traversal 5

Sponsored Links