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]