In Python,

Pastebin Link to Class: https://pastebin.com/W07NLXAW

One way to represent a binary tree is using the nested list format Consider the following binary tree: 24 72 51 This binary tree could be represented using a nested list as follows: S5, [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 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). tree. The first item in the list is the data value of the Define a function called convert tree to listO 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 getright(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 getdata(self: return self.data For example: Test Result t- BinaryTree (1234 C'12345" None, None] result-convert tre e to list(t) print(result) b . BinaryTree(5) E : ,[[78., None, wone51', e, C7*, None, None ]] [25 , None, None], None]], bBinaryTree(24 cBinaryTreeC8) dBinaryTree(51) e BinaryTree 25 g BinaryTree(78 f.setright(g) d.set_left(e b.set left(C b.set right(d) a.set left(b a.set_right(f) result-convert_tre e to list(a) print(result) 2 528 8