Use C++ program to do the following jobs:
1. Build a binary search tree with a node that has info 36 and no children.
2. Add the following nodes one at a time into the empty tree that you just created.
     47, 23, 19, 22, 11, 49, 42, 63, 7, 2, 21
3. Use inorder traverse to print all nodes in the tree.
4. Write a function to find the smallest number in the tree and call the function to print it.