create three Binary Search Trees as described below. The three trees would be calledtree1, tree2 and tree3.

tree1: Insert the indicated integer data in the order specified below.

31 42 3 11 6 8 57 36

tree2: create post-order traversal of tree1 and insert the post-order traversal data from tree1 into tree2.

tree3: create pre-order traversal of tree2 and insert the pre-order traversal data from tree2 into tree3.

After inserting into each tree, draw each of the three trees as indicated below. Where indicated below, write down the height and the number of leaves in each tree. When drawing, the root of the tree is at the top.