Chapter 17, Problem 5RE

Explanation of Solution

Tree:

• A data structure that is present in the hierarchical form and is composed of nodes.
• Each of the node will be having a sequence of child nodes and also one of the node is considered to be a root node.

Difference between the binary tree and binary search tree:

• Binary tree is a tree which can have maximum of two children.
• Binary search tree is a type of binary tree but with a constraints. The constraint for a binary tree to be a binary search tree:
• The left child of any node must have the value less than the value stored in the node and the right child must have the value greater than the value stored in the node.

Examples:

The example of both in the form of tree diagrams are shown below: