A PYTHON question :

a).Draw a binary tree structure created by the following code fragment:

a = BinaryTree(32)

a.insert_left(76)

a.insert_right(31)

x = a.get_left()

x.insert_left(8)

x.insert_right(8)

y = a.get_right()

y.insert_left(50)

y.insert_right(31)

b). What is the nested list representation of the binary tree?

c).What is the output if we print the tree vertically?

d).Write the pre-order, in-order and post-order traversal of the above binary tree. Include a brief explanation of the steps