Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
What does the following pseudo-code method, Calculate, return if it is called with a link to a binary tree? The following class definition for a node in a binary tree is used: class BinaryNode { int element; BinaryNode left; right; BinaryNode

What does the following pseudo-code method, Calculate, return if it is called with a link to a binary tree? The following class definition for a node in a binary tree is used: class BinaryNode { int element; BinaryNode left; right; BinaryNode

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

binary search

What does the following pseudo-code method, Calculate, return if it is called with a link to a binary tree? The following class definition for a node in a binary tree is used: class BinaryNode { int element; BinaryNode 1left; BinaryNode right; } int Calculate (BinaryNode root) { int lh=0; int rh=0; int dummy-0; if (root != nul1) { // leaf node's height is zero if ((root.left == null) && (root.right == null)) return 0; else { 1h = Calculate(root.left); rh = Calculate(root.right); if (1h > rh) dummy = 1 + lh; else dummy = 1 + rh; return dummy; return -1;
Transcribed Image Text:What does the following pseudo-code method, Calculate, return if it is called with a link to a binary tree? The following class definition for a node in a binary tree is used: class BinaryNode { int element; BinaryNode 1left; BinaryNode right; } int Calculate (BinaryNode root) { int lh=0; int rh=0; int dummy-0; if (root != nul1) { // leaf node's height is zero if ((root.left == null) && (root.right == null)) return 0; else { 1h = Calculate(root.left); rh = Calculate(root.right); if (1h > rh) dummy = 1 + lh; else dummy = 1 + rh; return dummy; return -1;
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS