MyProgrammingLab with Pearson eText -- Access Code Card -- for Building Java Programs
MyProgrammingLab with Pearson eText -- Access Code Card -- for Building Java Programs
5th Edition
ISBN: 9780135472460
Author: REGES, Stuart, Stepp, Marty
Publisher: PEARSON
Question
Book Icon
Chapter 17, Problem 1E
Program Plan Intro

A method “countLeftNodes()”

Program plan:

  • Define the method “countLeftNodes()”,
    • Return the value returned from the parameterized method “countLeftNodes()”.
  • Define the parameterized method “countLeftNodes()”,
    • Check whether the root of the tree is null,
      • If it is true, return “0”.
        • Otherwise, check whether the left node of the tree is null,
          • Return the value returned from the parameterized method “countLeftNodes()”.
        • Otherwise, return the calculated value.

Expert Solution & Answer
Check Mark
Program Description Answer

This program demonstrates the method “countLeftNodes()” that return the number of left children in the tree.

Explanation of Solution

Code:

//Define the method

public int countLeftNodes()

{

/*Return the value returned from the parameterized method "countLeftNodes()"*/

    return countLeftNodes(overallRoot);

}

//Define the parameterized method method "countLeftNodes()"

private int countLeftNodes(IntTreeNode root1)

{

    //Check whether the root is null

    if (root1 == null)

    {

        //Return "0"

        return 0;

    }

/*Otherwise, check whether the left node of the tree is null*/

    else if (root1.left == null)

    {

/*Return the value returned from the parameterized method "countLeftNodes()"*/

        return countLeftNodes(root1.right);

    }

    else

    {

        //Return the calculated value

return 1 + countLeftNodes(root1.left) + countLeftNodes(root1.right);

    }

}

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
For this question you will perform two levels of quicksort on an array containing these numbers: 59 41 61 73 43 57 50 13 96 88 42 77 27 95 32 89 In the first blank, enter the array contents after the top level partition. In the second blank, enter the array contents after one more partition of the left-hand subarray resulting from the first partition. In the third blank, enter the array contents after one more partition of the right-hand subarray resulting from the first partition. Print the numbers with a single space between them. Use the algorithm we covered in class, in which the first element of the subarray is the partition value.   Question 1 options: Blank # 1   Blank # 2   Blank # 3
1. Transform the E-R diagram into a set of relations. Country_of Agent ID Agent H Holds Is_Reponsible_for Consignment Number $ Value May Contain Consignment Transports Container Destination Ф R Goes Off Container Number Size Vessel Voyage Registry Vessel ID Voyage_ID Tonnage
I want to solve 13.2 using matlab please help
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education