Write a C /C++ program to: 1. Get a sequence of integers (1~9). 2. Insert this sequence of integers one at a time into an empty binary search tree. 3. Calculate and print the height of this binary search tree. 4. Print this binary search tree in tree shape.

Examples: <== test #1 ==> input: 5 8 6 3 9 4 2 height: 3 tree: ===5=== =3===8= 2=4=6=9 <== test #2 ==> input: 3 5 4 8 2 1 height: 3 tree: ===3=== =2===5= 1===4=8 <== test #3 ==> input: 4 3 5 7 6 8 9 2 1 height: 5 tree: ===============4=============== =======3===============5======= ===2=======================7=== =1=======================6===8= ==============================9