Draw the binary search tree that is created if the following numbers are inserted in the tree in the given order.
12 15 3 35 21 42 14

Solution: (Draw (or print) the BST tree

List of the order of entry =

List the BST inorder traversal value: =

List the BST preorder traversal value =

List the BST postorder traversal value =