Chapter 17.6, Problem 34SC

Explanation of Solution

Binary tree:

A tree consists of nodes and each node will have at most two children is called as binary tree.

In a binary tree, a node will have at most two children.

Binary Search tree:

Binary search tree is a binary tree which fulfill the property that its descendant to the left are considered to have a small data value than that of the nodes data value and the descendant of the right at considered to have larger data values.

Structure of the heap while inserting the element 1:

Step1:

Insert 1 at the lower end as shown below: