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. Ineed solve part 3,4 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 t Hint: you need to use a stack node with key k starting by the parent toward the root.
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. Ineed solve part 3,4 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 t Hint: you need to use a stack node with key k starting by the parent toward the root.
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...
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.
Ineed solve
part 3,4
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%2F9b6a8b11-e973-4f28-be85-8d9d6a4a1561%2Fa93a7757-2fa5-4b9a-af1f-966d2295db2f%2Fsa6myp_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.
Ineed solve
part 3,4
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.
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY