Chapter 21, Problem 4AW

Explanation of Solution

Binary search tree:

• Binary search tree is a tree in which the nodes are sorted in the semantic order and it has the shape of binary tree.
• Nodes in the binary search tree can have zero, one, or two children.
• In a binary search tree, any node value is greater than the left sub tree and lesser than the right sub tree.
  • Node without children is called a leaf or end node.
  • A node that does not have a superior node is called a root node.
  • Root node is the starting node.
• The binary search will be performed until finding a search node or reaching the end of the tree.

Algorithm to count the number of leaf in a binary tree:

Step 1: Define a function named “leafCount” with the parameter “btree”.

Step 2: Check if “btree” is equal to null. If it is true, then return 0.

Step 3: Check if “btree.left” is equal to null and “btree.right” is equal to null. If this condition is true, then return 1.

Step 4: If both the condition fails, then return the summation of count of left tree and right tree by calling the function “leafCount ()” recursively...