Can you complete this program using same code please. DO not change any code. Thank you...
Can you complete this program using same code please. DO not change any code. Thank you
In this problem you are given the root of a BST and you want to return the summation of all the values in the BST. Remember that the summation of a BST is the summation of all the nodes in the left subtree + the summation of all the nodes in the right subtree + the value of the current node
Expected behavior:
root = None root = insert_node(root, 50) root = insert_node(root, 25) root = insert_node(root, 70) root = insert_node(root, 90) root = insert_node(root, 30) root = insert_node(root, 60) root = insert_node(root, 10) print(sum_tree(root) == 335)
class TreeNode:
def __init__(self, value):
self.value = value
self.left = None
self.right = None
def insert_node(cur_node, value):
if cur_node is None:
return TreeNode(value)
if value < cur_node.value:
cur_node.left = insert_node(cur_node.left, value)
else:
cur_node.right = insert_node(cur_node.right, value)
return cur_node
def sum_tree(cur_node):
# your code here
Homework Answers
class TreeNode:
def __init__(self, value):
self.value = value
self.left = None
self.right = None
def insert_node(cur_node, value):
if cur_node is None:
return TreeNode(value)
if value < cur_node.value:
cur_node.left =
insert_node(cur_node.left, value)
else:
cur_node.right =
insert_node(cur_node.right, value)
return cur_node
def sum_tree(cur_node):
if cur_node is None:
return 0
return cur_node.value + sum_tree(cur_node.left) +
sum_tree(cur_node.right)
root = None
root = insert_node(root, 50)
root = insert_node(root, 25)
root = insert_node(root, 70)
root = insert_node(root, 90)
root = insert_node(root, 30)
root = insert_node(root, 60)
root = insert_node(root, 10)
# print(sum_tree(root))
print(sum_tree(root) == 335)
Add Answer to:
Can you complete this program using same code please. DO not
change any code. Thank you...
PYTHON 3 PLEASE FOLLOW INSTRUCTIONS COMPLETE CODE Problem : Complete the function predecessor() to take in...
PYTHON 3 PLEASE FOLLOW INSTRUCTIONS COMPLETE CODE Problem : Complete the function predecessor() to take in an arbitrary node of a BST, and return the value of the predecessor of the given node. Code : class Node: def __init__(self, value): self.value = value self.left = None self.right = None def predecessor(node): # TODO
Can you help me with python question: Implement the function isBinarySearchTree(root), which returns True if the...
Can you help me with python question: Implement the function isBinarySearchTree(root), which returns True if the binary tree passed to it is a valid binary search tree. I've provided a simple TreeNode class, and the beginnings of isBinarySearchTree(root). class TreeNode: '''Node for a simple binary tree structure''' def __init__(self, value, left, right): self.value = value self.left = left self.right = right def isBinarySearchTree(tree):
Python question. How do i make this code work? im trying to print the value of...
Python question. How do i make this code work? im trying to print the value of the nodes using the level order trasversal class Node: def __init__(self, x): self.val = x self.left = None self.right = None class BinarySearchTree: def insertNode(self, value): self.root = self._insert(self.root, value) def levelOrderTraversal(self, root): if root is None: return [] result, current = [], [root] while current: next_level, vals = [], [] for node in current: vals.append(node.val) if node.left: next_level.append(node.left) if node.right: next_level.append(node.right) current...
Can you complete the following code, please? Thank you. class BinaryNode: def __init__(self, valu...
Can you complete the following
code, please? Thank you.
class BinaryNode:
def __init__(self, value):
self.__value = value
self.__left = None
self.__right = None
self.__parent = None
self.__height = 1
def getValue(self):
return self.__value
def setHeight(self, height):
self.__height = height
def getHeight(self):
return self.__height
def setParent(self, node):
self.__parent = node
def getParent(self):
return self.__parent
def setLeftChild(self, child):
self.__left = child
child.setParent(self)
def setRightChild(self, child):
self.__right = child
child.setParent(self)
def createLeftChild(self, value):
self.__left = BinaryNode(value)
def createRightChild(self, value):
self.__right = BinaryNode(value)
def...
Previous code: class BinarySearchTree: def __init__(self, data): self.data = data self.left = None self.right = None de...
Previous code:
class BinarySearchTree:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
def search(self, find_data):
if self.data == find_data:
return self
elif find_data < self.data and self.left != None:
return self.left.search(find_data)
elif find_data > self.data and self.right != None:
return self.right.search(find_data)
else:
return None
def get_left(self):
return self.left
def get_right(self):
return self.right
def set_left(self, tree):
self.left = tree
def set_right(self, tree):
self.right = tree
def set_data(self, data):
self.data = data
def get_data(self):
return self.data
def traverse(root,order):...
In the following code I give, everytime it will output ")". Input : ((A+B)*((C-D)/(E^F))) Expect...
In the following code I give, everytime it will output ")". Input : ((A+B)*((C-D)/(E^F))) Expected output : ((A+B)*((C-D)/(E^F))) A+B*C-D/E^F my output : ) My code : class Et: def __init__(self , value): self.value = value self.left = None self.right = None def isOperator(c): if (c == '+' or c == '-' or c == '*' or c == '/' or c == '^' ): return True else: return False def inorder(t): if t is not None: inorder(t.left) print (t.value) inorder(t.right)...
python pls and noticed the output added "" One way to represent a binary tree is using the nested list format Consider the following binary tree: 24 72 78 8 51 25 This binary tree could be...
python pls and noticed the output added ""
One way to represent a binary tree is using the nested list format Consider the following binary tree: 24 72 78 8 51 25 This binary tree could be represented using a nested list as follows [55, [24, [8, None, None], [51, [25, None, None], None]], [72, None, [78, None, None ]]] The nested list format always uses a list of length three to represent a binary tree. The first item in...
(Please help me with Coding in Python3) AVLTree complete the following implementation of the balanced (AVL)...
(Please help me with Coding in Python3) AVLTree complete the following implementation of the balanced (AVL) binary search tree. Note that you should not be implementing the map-based API described in the plain (unbalanced) BSTree notebook — i.e., nodes in the AVLTree will only contain a single value. class AVLTree: class Node: def __init__(self, val, left=None, right=None): self.val = val self.left = left self.right = right def rotate_right(self): n = self.left self.val, n.val = n.val, self.val self.left, n.left, self.right, n.right...
COMPLETE THE _CONSTRUCT() AND CONSTRUCTTREE() FUNCTIONS class expressionTree: class treeNode: def __init__(self, value, lchild, rchild):...
COMPLETE THE _CONSTRUCT() AND CONSTRUCTTREE() FUNCTIONS class expressionTree: class treeNode: def __init__(self, value, lchild, rchild): self.value, self.lchild, self.rchild = value, lchild, rchild def __init__(self): self.treeRoot = None #utility functions for constructTree def mask(self, s): nestLevel = 0 masked = list(s) for i in range(len(s)): if s[i]==")": nestLevel -=1 elif s[i]=="(": nestLevel += 1 if nestLevel>0 and not (s[i]=="(" and nestLevel==1): masked[i]=" " return "".join(masked) def isNumber(self, expr): mys=s.strip() if len(mys)==0 or not isinstance(mys, str): print("type mismatch error: isNumber")...
PYTHON QUESTION... Building a Binary Tree with extended Binary Search Tree and AVL tree. Create a...
PYTHON QUESTION... Building a Binary Tree with extended Binary Search Tree and AVL tree. Create a class called MyTree with the methods __init__(x), getLeft(), getRight(), getData(), insert(x) and getHeight(). Each child should itself be a MyTree object. The height of a leaf node should be zero. The insert(x) method should return the node that occupies the original node's position in the tree. Create a class called MyBST that extends MyTree. Override the method insert(x) to meet the definitions of a...
Can you complete the following
code, please? Thank you.
class BinaryNode:
def __init__(self, value):
self.__value = value
self.__left = None
self.__right = None
self.__parent = None
self.__height = 1
def getValue(self):
return self.__value
def setHeight(self, height):
self.__height = height
def getHeight(self):
return self.__height
def setParent(self, node):
self.__parent = node
def getParent(self):
return self.__parent
def setLeftChild(self, child):
self.__left = child
child.setParent(self)
def setRightChild(self, child):
self.__right = child
child.setParent(self)
def createLeftChild(self, value):
self.__left = BinaryNode(value)
def createRightChild(self, value):
self.__right = BinaryNode(value)
def...
Previous code:
class BinarySearchTree:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
def search(self, find_data):
if self.data == find_data:
return self
elif find_data < self.data and self.left != None:
return self.left.search(find_data)
elif find_data > self.data and self.right != None:
return self.right.search(find_data)
else:
return None
def get_left(self):
return self.left
def get_right(self):
return self.right
def set_left(self, tree):
self.left = tree
def set_right(self, tree):
self.right = tree
def set_data(self, data):
self.data = data
def get_data(self):
return self.data
def traverse(root,order):...
python pls and noticed the output added ""
One way to represent a binary tree is using the nested list format Consider the following binary tree: 24 72 78 8 51 25 This binary tree could be represented using a nested list as follows [55, [24, [8, None, None], [51, [25, None, None], None]], [72, None, [78, None, None ]]] The nested list format always uses a list of length three to represent a binary tree. The first item in...
Most questions answered within 3 hours.
-
Calculate the pH of a 5.7 M solution of aniline (C6H5NH2; Kb =
3.8 x 10^-10)
asked 1 hour ago -
LSL R3, R3, R12
Memory
Address
Orig.
Data
Updated
Data
Register
Orig.
Data
Updated
Data
0x84F0...
asked 1 hour ago -
Air at 100 kPa and density of 1.2 kg/m3 flows upward through a
5-cm diameter inclined...
asked 1 hour ago -
Define the following concepts in your own words: (a) stiffness,
(b) strength, (c) strain,
(d) ductility,...
asked 2 hours ago -
In C++
In this homework, you will be tasked with creating functions to
manipulate strings that...
asked 2 hours ago -
An isolated colony represents a pure culture. one rare occasions
, however , a colony can...
asked 2 hours ago -
*****DO NOT ANSWER THIS QUESTION IF YOU DON'T
KNOW*******Rights and Duties of Auditors; Minimum 4000
words...
asked 3 hours ago -
The probability that Janie is wearing sunglasses is 1/4. The
probability that she is wearing sunglasses...
asked 4 hours ago -
Do you believe social media is more of a help or a hindrance in
controlling crises...
asked 4 hours ago -
Two long, parallel wires separated by 2.85 cm carry currents in
opposite directions. The current in...
asked 4 hours ago -
Question # 1. Develop a list of rehabilitation journals
that publish articles concerning career counseling for...
asked 4 hours ago -
Bryant Company has a factory machine with a book value of
$85,100 and a remaining useful...
asked 4 hours ago