C exercises and solutions: Binary Search Tree 

C pointer: Binary Search Tree======================================================================================
Binary Search Tree Operations
Menu
Enter your choice:1
root node. The nodes that are less than the root node will be put in the left side and the nodes that are greater than the root node will be put in the right side. The nodes that are in the higher positions are called the parent nodes and the nodes that are in the lower positions are called child nodes. The parent nodes may have more than one child. It also may not have a child. The node that doesn't have a child is called leaf.
Solution: To keep this solution simple and easy to follow, we divide this solution in to different steps. Step 1: Defining the binary search tree node Each node of the binary search tree contains 3 componentsdata and two links. The two links are pointers. One pointer points to the left child and another points to the right child. In this step, we also declare a root node pointer. It is a start node of our binary search tree.
typedef struct TreeNode{ 

