Question

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 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). Define a function called convert_tree_to_list) that takes a binary tree as input and which returns the nested list format of the tree as output. You can assume the binary tree passed as input to the function is an instance of the following BinaryTree class, which is provided to you - you can use the functions available in this class: class BinaryTree: def-init-(self, data): self.data-data 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.data data def get_data (self): return self.data For example Test Result t-BinaryTree(12345) '12345', None, None] result convert-tree-to-list(t) print(result) 55', ['24", ['8',None, None], [ s1', ['25", None, None], None]], ['72", None, ['78,None, None]]] a BinaryTree (55) b BinaryTree (24) c = BinaryTree(8) d BinaryTree(51) e- BinaryTree (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) result- convert tree to_list(a) print(result)

Answer 1

use -11w as a reference in Convert Incl ton-- salf. item ileun 1 while głack l^ nodo sNone t hode iy hot None node s nade. Last Scanned wit relon CamScanner