Chapter 21, Problem 1FTE

Explanation of Solution

Given program code:

//Return the number of nodes in a binary tree

int Nodecount (Node tree) //Line 1

{ //Line 2

    //Declare a variable to get the number of nodes

    int count = 0; //Line 3

    //Check if tree is not equal to null

    if (tree != null) //Line 4

    { //Line 5

        //Increment the value of count

        count++; //Line 6

//Call the function recursively by passing the left sub tree

        NodeCount(tree.left); //Line 7

//Call the function recursively by passing the right sub tree

        NodeCount(tree.right); //Line 8

    } //Line 9

    //Return the value of count

    return count;//Line 10

}//Line 11

The above program code snippet is used to find the number of nodes present in the binary tree.

Error in the program code:

The statements inside the “if” condition does not use the returned values from the recursive calls. The lines from “Line 6” to “Line 10” should be changed and the modified snippet is given below...