Consider a binary search tree (BST) that is initially empty. Draw the tree...

[ahmed s]

...that will result if the following n? a)Pre order Traversal
b)Inorder Traversal
c)Postorder Traversal