Chapter 17, Problem 3RE

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.

Total path length of the tree:

• The path length of the tree is determined by the total number of nodes present in a path.
• The total path refers to the sum of length of all the path from the root node to the leaf nodes.
• The below is the recursive algorithm to find the total path length of the tree:

Algorithm:

//function use to find the length of the trees

public int path_length(Node root,int num_node)

{

//if condition to check whether the number of child node is 1

if(num_node==1)

  return 0;

...