Chapter 21, Problem 16RQE

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.

Searching data in binary tree:

• Binary tree suits best when searching large amount data, because it will consume less amount of time, since the search is based on the indexing
• In case of searching the data in standard linked list it is a linear, the search will be performed for the one element to another element till the search element is found in a sequential manner.
• In a binary tree, the data are stored in form of organized key structure, such that the search is performed based on the index values.
• It facilitates the search such that when a particular element is searched it looks for the index value that is stored directly, instead of searching each and every element that is present in the binary tree.