Question

Given a binary tree, it is useful to be able to display all of its data values. For this task, define a function called basic_print() which prints out all of the data values in a binary tree. The natural way to solve this problem is to use recursion. The diagram below illustrates a recursive solution to the problem, which consists of three simple steps: Step1: Print the root node Step 3: Print the right sub-tree 10 Step 2: Print the left sub-tree 2 7 15 Steps 2 and 3 would be solved by calling the basic_print() function recursively. For example, given the following binary tree: 72 24 8 78 ) 51 25 the output of the basic_print() function should be as follows: 55 24 8 51 25 72 78 Note, each data value is separated by a space. You can assume that the BinaryTree class is available to you (you do not need to submit this class). The only functions from this class that you will need to call are: get_data0, get_left() and get_right(). The Binary Tree class is shown below: class BinaryTree: def-init-(self, data): self.datadata self.left - None self.right -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.datadata def get_data(self): return self.data For example Test Result tBinaryTree (12345)12345 basic_print (t) aBinaryTree (55) 55 24 8 51 25 72 78 b-BinaryTree (24) cBinaryTree (8) d - BinaryTree (51) eBinaryTree (25) f BinaryTree (72) g-BinaryTree (78) f.set_right (g) d.set_left(e) b.set_left(c) b.set right (d) a.set_left(b) a.set right(f) basic_print (a)

Answer 1

def basic_print(root):

print(root.get_data(),end=" ")

if root.get_left():

basic_print(root.get_left())

if root.get_right():

basic_print(root.get_right())

Your Code. 1 def basic_print(root): print (root.get data(),end-"") 5. İf root, get-left(): basic print (root.get left ()) if root.get_right): 10 basic_print (root.get_right))

Output

NA. Since complete binary tree code not given.