To class Tree that represents binary search tree (BST), add the following method: 1- printByLevel () which prints the nodes in the tree level by level, it prints all nodes in a specific level before moving to the nodes at the next depth level. For example this tree should be printed as follows: 11 6 19 4 8 17 43 5 10 31 49 Hint: you need to use a queue. 2- nodesInLevel(int x): it returns number of nodes in a specific level x. for example in this tree, nodesInLevel(2) is 4 Hint: this method should call a recursive method. 3- iterativelnOrder : it prints all nodes using in-order approach without using recursion. Hint: you need to use a stack. 4- ancestors( int k): it prints all ancestor of the node with key k starting by the parent toward the root. Hint: you need to use a stack
To class Tree that represents binary search tree (BST), add the following method: 1- printByLevel () which prints the nodes in the tree level by level, it prints all nodes in a specific level before moving to the nodes at the next depth level. For example this tree should be printed as follows: 11 6 19 4 8 17 43 5 10 31 49 Hint: you need to use a queue. 2- nodesInLevel(int x): it returns number of nodes in a specific level x. for example in this tree, nodesInLevel(2) is 4 Hint: this method should call a recursive method. 3- iterativelnOrder : it prints all nodes using in-order approach without using recursion. Hint: you need to use a stack. 4- ancestors( int k): it prints all ancestor of the node with key k starting by the parent toward the root. Hint: you need to use a stack
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
![To class Tree that represents binary search tree (BST), add the following method:
1- printByLevel ( ) which prints the nodes in the tree level by level,
it prints all nodes in a specific level before moving to the nodes
at the next depth level. For example this tree should be printed as
follows:
11 6 19 4 8 17 43 5 10 31 49
Hint: you need to use a queue.
2- nodesInLevel(int x): it returns number of nodes in a specific level x. for example in this tree,
nodesInLevel(2) is 4
Hint: this method should call a recursive method.
3- iterativelnOrder : it prints all nodes using in-order approach without using recursion.
Hint: you need to use a stack.
4- ancestors( int k): it prints all ancestor of the node with key k starting by the parent toward the root.
Hint: you need to use a stack](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2747919f-838e-456d-b989-5a6e905abdda%2F471f6cd6-eb68-4b3d-975c-bd11bf9d709a%2Fju0hxuxj_processed.jpeg&w=3840&q=75)
Transcribed Image Text:To class Tree that represents binary search tree (BST), add the following method:
1- printByLevel ( ) which prints the nodes in the tree level by level,
it prints all nodes in a specific level before moving to the nodes
at the next depth level. For example this tree should be printed as
follows:
11 6 19 4 8 17 43 5 10 31 49
Hint: you need to use a queue.
2- nodesInLevel(int x): it returns number of nodes in a specific level x. for example in this tree,
nodesInLevel(2) is 4
Hint: this method should call a recursive method.
3- iterativelnOrder : it prints all nodes using in-order approach without using recursion.
Hint: you need to use a stack.
4- ancestors( int k): it prints all ancestor of the node with key k starting by the parent toward the root.
Hint: you need to use a stack
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education