Programming Language: Python

This question is very similar to the previous question, except this time the tree that you build will be a little bigger Define a function called create a tree0 which builds and returns the following binary tree b' As before, the BinaryTree class is provided to you (and is listed for your reference below). You only need to call the BinaryTree0, insert left0 and insert_right0 functions, but this time you will find the get left) and get_ right0 functions useful. class Binary Tree def init (self, data): self.data = data self.left = None self.right = None def insert left self, new data): if self. left = None: self.let. BinaryTree(new data) else t BinaryTree(new data) t. left = selfleft self. left t def insert right self, new _data) if self.rights. None: self.right BinaryTree(new data) else t BinaryTree(new data) t.right self.right self.right t def get left(self) def get right (self) def set data(self, data) def get data(self) return self.left return self.right self.data = data return self.data HINT: Take care that whenever you call insert left0 or insert right0, the only input you pass to these functions is a character. You won't want to pass a BinaryTree object as an input to these functions Define the create a tree0 function below: def create_a_tree) For example: Test Result a create-a-tree( = rint(a.get data print(a.get leftO.get data print(a.getrightO.get dataO print(a.get_leftO.get_rightO.get_dataO)