At each recursive call, half the tree is eliminated from further processing, if the tree is balanced. T is a pointer to a tree node at which find operation will begin. Here T is a pointer to the root node of a subtree in which you want to find the minimun or maximum value. When found, return a pointer to the node having that value. T is a pointer reference to root node of subtree in which X will be inserted.
Steps are almost identical to find.
The rest of Insert operates just like Find , since it looks for X in the tree. If X is not found, the result will be that T is eventually NULL . At that point, create a node and put X in it. Pass the address of the new node to the pointer that was NULL , thereby linking the node into the tree. At the same time, initialize the pointer field of the new node to NULL .