Write a program to implement a binary search tree. User will provide the number of nodes in the (size of the) Tree by selecting an input number between 10 to 30. This program will automatically generate a binary tree of specified size by assigning random numbers between 5 to 30 to Each of its node and display final tree to user. Later he will convert this tree to binary search tree.

Sample Output:

Enter the number of nodes in the tree: 5

The Tree before conversion of BST is

10 -> 2

10 -> 7

2 -> 8

2 -> 4

After converting the tree to BST

8 -> 10

8 -> 4

4 -> 2

4 -> 7

2) Write a program to implement a binary search tree. User provides an input between the ranges of 5 to 30. The program should automatically generate a tree having the nodes between the number 0 to N(User provided input) and display it to user(As we did in last question, each node will have a random number between 5 to 30). Finally, this tree will be converted into binary search tree. Later implement tree traversal techniques. The user should choose the type of traversal and accordingly it should display. You need to display 3 techniques. They are Inorder, Preorder and Postorder.