Let the binary search tree (BST) which is initially empty. Sketch the tree which will result if 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 the BST perform following operations on it.
a) Pre order Traversal
b) Inorder Traversal
c) Postorder Traversal