Given a pointer to the root of a binary tree and a pointer 'p' to a given node in the tree and a second pointer 'q' to another node in the tree write a routine which will return the total number of nodes in the tree that are between levels p and q. You can assume that p is on a smaller level than q (higher in the tree for example level 3) and q is on a higher level (for example level 5). In this case I would want to know the number of nodes on levels 3 4 and 5. If p was on level 2 and q on level 5 I would want to know the total number of nodes on levels 2 3 4 and 5. Remember don't hardcode values for p and q you must also figure out which level they are on.
Given a pointer to the root of a binary tree and a pointer 'p' to a given node in the tree and a second pointer 'q' to another node in the tree write a routine which will return the total number of nodes in the tree that are between levels p and q. You can assume that p is on a smaller level than q (higher in the tree for example level 3) and q is on a higher level (for example level 5). In this case I would want to know the number of nodes on levels 3 4 and 5. If p was on level 2 and q on level 5 I would want to know the total number of nodes on levels 2 3 4 and 5. Remember don't hardcode values for p and q you must also figure out which level they are on.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Java, now meed
Please answer
Transcribed Image Text:V.
Given a pointer to the root of a binary tree and a pointer 'p' to a given node in the
tree and a second pointer 'q' to another node in the tree write a routine which will return the
total number of nodes in the tree that are between levels p and q. You can assume that p is
on a smaller level than q (higher in the tree for example level 3) and q is on a higher level
(for example level 5). In this case I would want to know the number of nodes on levels 3 4
and 5. If p was on level 2 and q on level 5 I would want to know the total number of nodes
on levels 2 3 4 and 5. Remember don't hardcode values for p and q you must also figure out
which level they are on.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 4 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education