C++

Write a program to do the following:

a. Build a binary search tree, T1.

b. Do a postorder traversal of T1 and, while doing the postorder traversal, insert the nodes into a second binary search tree T2.

c. Do a preorder traversal of T2 and, while doing the preorder traversal, insert the node into a third binary search tree T3.

d. Do an inorder traversal of T3.

e. Output the heights and the number of leaves in each of the three binary search trees.