EXISTING CODE

class BinaryTree: def __init__(self, data, left=None, right=None): self.data = data self.left = left self.right = right

def insert_left(self, new_data): if self.left == None: self.left = BinaryTree(new_data) else: t = BinaryTree(new_data, left=self.left) self.left = t

def insert_right(self, new_data): if self.right == None: self.right = BinaryTree(new_data) else: t = BinaryTree(new_data, right=self.right) self.right = t

def get_left(self): return self.left

def get_right(self): return self.right

def set_data(self, data): self.data = data

def get_data(self): return self.data

def set_left(self, left): self.left = left

def set_right(self, right): self.right = right def get_multiple_of_number(self, number): if self.get_data() % number == 0: return self.get_data() else: return 0

def print_tree(tree, level): print(' ' * (level*4) + str(tree.get_data())) if tree.get_left() != None: print('(L)', end = '') print_tree(tree.get_left(), level + 1) if tree.get_right() != None: print('(R)', end = '') print_tree(tree.get_right(), level + 1)

Define a function named get_sum_multiples_of_number (tree, number) which takes a binary tree object and returns the sum of all the values in the tree that are multiples of the parameter number. For example, consider the following: 42 (L) 21 (L) 11 (R) 29 (R) 65 (L) 50 (R) 91 The output of the function call get_sum_multiples_of_number(tree, 3 ) is 63 (i.e. 42+21 ). Note: - You can assume that the binary tree only contains integer values. - If the tree is empty, the function returns 0. - You should use the get_multiple_of_number() method defined in Question 5. Note: A BinaryTree implementation is provided to you as part of this exercise - you should not define your own BinaryTree class. Instead, your code can make use of any of the BinaryTree ADT data fields and methods. For example: Answer: (penalty regime: 0,0,5,10,15,20,25,30,35,40,45,50% )