Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
In Python, please. The first image is a starter code. The image may be blurry,

In Python, please. The first image is a starter code. The image may be blurry,

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

In Python, please. The first image is a starter code. The image may be blurry, but it will be clear when you zoom it in. Thank you!

class Node: def _init_(self, value): self.value = value self. left = None self.right = None def str_(self): return ("Node({})".format(self.value)) _repr_ =_str_ class BinarysearchTree: >>> x=BinarySearchTree() >>> x.isEmpty() True >>> x.insert(9) >>> x.insert(4) >>> x.insert(11) >>> x.insert(2) >>> x.insert(5) >>> x.insert(10) >>> x.insert(9.5) >>> x.insert(7) >>> x.getMin Node(2) >>> x.getMax Node(11) >>> 67 in x False >>> 9.5 in x True >>> x.isEmpty() False >>> x.getHeight(x.root) 3 # Height of the tree >>> x.getHeight(x.root.left.right) 1 >>> x.getHeight(x.root.right) >>> x.getHeight(x.root.right.left) 1 >>> x.printInorder 2:4:5: 7:9: 9.5 : 10 : 11 : >>> new_tree = x.mirror() 11 : 10 : 9.5 : 9: 7 :5:4:2 : >>> new_tree.root.right Node (4) >>> x.printInorder 2:4: 5: 7 : 9 : 9.5 : 10 : 11 : def init_(self): self.root = None def insert(self, value): if self.root is None: self.root=Node(value) else: self._insert(self.root, value) def _mirrorHelper(self, node): # YOUR CODE STARTS HERE pass def _insert(self, node, value): if(value<node.value): if(node. left==None): node. left = Node(value) else: self._insert(node.left, value) else: if(node.right==None): node.right = Node (value) else: self. insert(node.right, value) @property def printInorder (self): if self.isEmpty(): return None else: self._inorderHelper (self.root) def _inorderHelper (self, node): if node is not None: self._inorderHelper (node. left) print(node.value, end=' : ') self. inorder Helper (node.right) def mirror(self): # Creates a new BST that is a mirror of self: Elements greater than the root are on the left side, and smaller values on the right side # Do NOT modify any given code if self.root is None: return None else: newTree = BinarySearchTree() newTree.root = self._mirrorHelper (self.root) newTree.printInorder return newTree def isEmpty(self): # YOUR CODE STARTS HERE pass
Transcribed Image Text:class Node: def _init_(self, value): self.value = value self. left = None self.right = None def str_(self): return ("Node({})".format(self.value)) _repr_ =_str_ class BinarysearchTree: >>> x=BinarySearchTree() >>> x.isEmpty() True >>> x.insert(9) >>> x.insert(4) >>> x.insert(11) >>> x.insert(2) >>> x.insert(5) >>> x.insert(10) >>> x.insert(9.5) >>> x.insert(7) >>> x.getMin Node(2) >>> x.getMax Node(11) >>> 67 in x False >>> 9.5 in x True >>> x.isEmpty() False >>> x.getHeight(x.root) 3 # Height of the tree >>> x.getHeight(x.root.left.right) 1 >>> x.getHeight(x.root.right) >>> x.getHeight(x.root.right.left) 1 >>> x.printInorder 2:4:5: 7:9: 9.5 : 10 : 11 : >>> new_tree = x.mirror() 11 : 10 : 9.5 : 9: 7 :5:4:2 : >>> new_tree.root.right Node (4) >>> x.printInorder 2:4: 5: 7 : 9 : 9.5 : 10 : 11 : def init_(self): self.root = None def insert(self, value): if self.root is None: self.root=Node(value) else: self._insert(self.root, value) def _mirrorHelper(self, node): # YOUR CODE STARTS HERE pass def _insert(self, node, value): if(value<node.value): if(node. left==None): node. left = Node(value) else: self._insert(node.left, value) else: if(node.right==None): node.right = Node (value) else: self. insert(node.right, value) @property def printInorder (self): if self.isEmpty(): return None else: self._inorderHelper (self.root) def _inorderHelper (self, node): if node is not None: self._inorderHelper (node. left) print(node.value, end=' : ') self. inorder Helper (node.right) def mirror(self): # Creates a new BST that is a mirror of self: Elements greater than the root are on the left side, and smaller values on the right side # Do NOT modify any given code if self.root is None: return None else: newTree = BinarySearchTree() newTree.root = self._mirrorHelper (self.root) newTree.printInorder return newTree def isEmpty(self): # YOUR CODE STARTS HERE pass
_mirrorHelper(self, node_object) The starter code contains a method called mirror, that takes the BinarySearchTree object and returns a new BinarySearchTree object that represents a mirror image of the original tree. For example, for the following tree: Inorder traversal: 1, 2, 7,9, 26, 36 26 1 7 36 A call to mirror results in a new tree as shown: 9. Inorder traversal: 36, 26,9, 7, 2, 1 26 2 36 7 1 Complete the implementations of _mirrorHelper that takes a reference to a Node in the original tree and interchanges the links of the left and right children of all non-leaf nodes in the new tre. For example, if the node is a reference to 2, then in the new tree, 2.left=7 and 2.right=1. Do not modify the implementation for mirror in any way, otherwise you will not receive credit Input Node node_object A node in the tree Output Node A reference to the root of the new tree
Transcribed Image Text:_mirrorHelper(self, node_object) The starter code contains a method called mirror, that takes the BinarySearchTree object and returns a new BinarySearchTree object that represents a mirror image of the original tree. For example, for the following tree: Inorder traversal: 1, 2, 7,9, 26, 36 26 1 7 36 A call to mirror results in a new tree as shown: 9. Inorder traversal: 36, 26,9, 7, 2, 1 26 2 36 7 1 Complete the implementations of _mirrorHelper that takes a reference to a Node in the original tree and interchanges the links of the left and right children of all non-leaf nodes in the new tre. For example, if the node is a reference to 2, then in the new tree, 2.left=7 and 2.right=1. Do not modify the implementation for mirror in any way, otherwise you will not receive credit Input Node node_object A node in the tree Output Node A reference to the root of the new tree
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS