Data Structure $($by python$)$

Question One $($Trees$)$:

$1.$ Determine the number of nodes on a given level $L$ in a full binary tree? Express your answer in terms of $L.$

$2.$ Write the expression represented by the following expression tree in infix, prefix, and postfix notations.

$($Hint: Use the inorder, preorder, and postorder traversals described in this section to obtain your answers.$)$

$3.$ Assume that a node is at position $12$ in a list representation of a binary tree. Assume also that the root of the tree starts at index $0$ of the list. Give the positions of that node's parent, left child, and right child.

$($if any drewing or coding there pls proived all deatails and explanation$)$