Please see the Task for the question. '

Also provided is background information for further explanation for the question and also the code that was given with the question.

Please the question as such that the output follows the test code. (Must be done in python)

Background Information:

Question / Task

Code:

Carefully examine the minimal BinaryTree class provided in Q4.py. Each instance of this class has three attributes: data, left and right. The data attribute stores the data value for a given node in the tree. The left and right attributes refer to subtrees that are valid BinaryTree objects, and which represent the left and right subtrees of the node respectively. If a node does not have a subtree, then the corresponding left or right attribute will have the value None. 2 2 8 51 7 Consider the binary tree shown in the diagram on the right. This binary tree could be represented by two lists that use quite different approaches for encoding the tree structure. Their definitions have been covered in our lectures. 2 A nested list [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 the list is the data value of the root, the second item in the list is the left subtree (this may be None if the left subtree is empty, or it may be a nested list) and the third item in the list is the right subtree (this may be None if the right subtree is empty, or it may be a nested list) A flat list [None, 55, 24, 72, 8, 51, None, 78, None, None, 25] The flat list format always begins with the value None, so that the data value of the root is stored in index position 1. For any node at index position i, the left child is stored at index position 2 , and the right child is stored at index position 2*i+1. A value of None in the list means there is no child at the corresponding index position