Given a binary tree with integer data at all nodes (including leaves), your task is to create a pretty printer. Each node in the tree can have 0, 1, or 2 children in python3. constructor that takes a required int argument for the data stored in the node, and two optional Node arguments for the left and right children, respectively. __str__(self) -> str: returns a string representation of the subtree rooted at the self node [must use recursion] compute_height(self) -> int: returns the height of the current node. The height is the distance of the longest path between a leaf node and the current node. [must use recursion] pretty_print(self, indent: int): prints a formatted tree string with each node on a separate line, using the format value: height, and making sure that sibling and cousin nodes (i.e., those at the same distance from the root node) are indented using the same number of spaces (see example below). The root is indented 0 spaces, the children of the root are indented a single space, their children (root's grandchildren) are indented 2 spaces, etc. [must use recursion]
Given a binary tree with integer data at all nodes (including leaves), your task is to create a pretty printer. Each node in the tree can have 0, 1, or 2 children in python3. constructor that takes a required int argument for the data stored in the node, and two optional Node arguments for the left and right children, respectively. __str__(self) -> str: returns a string representation of the subtree rooted at the self node [must use recursion] compute_height(self) -> int: returns the height of the current node. The height is the distance of the longest path between a leaf node and the current node. [must use recursion] pretty_print(self, indent: int): prints a formatted tree string with each node on a separate line, using the format value: height, and making sure that sibling and cousin nodes (i.e., those at the same distance from the root node) are indented using the same number of spaces (see example below). The root is indented 0 spaces, the children of the root are indented a single space, their children (root's grandchildren) are indented 2 spaces, etc. [must use recursion]
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
Given a binary tree with integer data at all nodes (including leaves), your task is to create a pretty printer. Each node in the tree can have 0, 1, or 2 children in python3.
- constructor that takes a required int argument for the data stored in the node, and two optional Node arguments for the left and right children, respectively.
- __str__(self) -> str: returns a string representation of the subtree rooted at the self node [must use recursion]
- compute_height(self) -> int: returns the height of the current node. The height is the distance of the longest path between a leaf node and the current node. [must use recursion]
- pretty_print(self, indent: int): prints a formatted tree string with each node on a separate line, using the format value: height, and making sure that sibling and cousin nodes (i.e., those at the same distance from the root node) are indented using the same number of spaces (see example below). The root is indented 0 spaces, the children of the root are indented a single space, their children (root's grandchildren) are indented 2 spaces, etc. [must use recursion]
Expert Solution
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 4 steps with 2 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
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)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY