Chapter 19.1, Problem 19.5CP

Program Plan Intro

Binary tree:

• Binary tree is a non-linear data structure.
• Binary tree contains node such as root node that is pointed to two child nodes.
• A root node will have left reference node and right reference node.
• Binary tree will contain more than one self-referenced field.
• Binary tree is similar to an upside down tree. Its structure is anchored at the top 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.
• When a node does not contain any child node is called as leaf node.