Chapter 19.2, Problem 19.12CP

Program Plan Intro

Operations that are performed on Binary search tree:

Binary search tree performs various operations such as:

• Creating a binary tree
• Inserting nodes
• Finding nodes
• Deleting nodes

Leaf node:

Binary tree is similar to an upside down tree. It structure is anchored at the top by using a tree pointer that resembles the header pointer of the standard linked list.

• The first node that is present in the tree is called as root node. Every root node will have pointer to other nodes namely child nodes. Child nodes are also referenced using pointers.
• When a node does not contain any child node is called as leaf node.