Binary Search Tree: Create a binary search tree using the Insert function. Insert integers 10, 18, 7, 2, 20, and 15 sequentially into an empty binary tree using class representation. Using in-order traversal, print the results.

struct TreeNode

{

int info;

TreeNode * left;

TreeNode * right;

}

Use the following function prototypes:

void inOrder(TreeNode *);

void insert(TreeNode *&, int );

int countNodes(TreeNode *);

TreeNode *TreeSearch(TreeNode * , int );