Can you help with this python assignment

Problem 1 In class, we discussed the preorder traversal of a binary tree. The code in the slides is recursive. Rewrite the pm min function such that c it lemma the nodes" values in a Python list instead of printing them out, and o it is iterative instead of recursive. Problem 2 Given the preorder and inorder traversals of a tree, construct the binary tree, assuming the values of all nodes in the tree are distinct. The preorder and inorder traversals are represented as Python lists, with the elements being the values of the nodes. The output is the root of the constructed binary tree. Note: Assume the inputs are always valid, i.e., there is always a unique binary tree given the input preorder and inorder traversals. Example: Given preorder = [3, 9, 20, 15, 7] inorder = [9, 3, 15, 20, 7], the constructed binary tree is 9 20Dashboard class BinaryTreeNode: def _init_(self, data) : self . val = data Courses self . left = None self . right = None Groups 1. Iterative preorder traversal of a binary tree def preorder ( root ) : return Inbox 2. Reconstruct Binary Tree UCD Library # inorder traversal can be divided as [left-subtree-nodes, root, right- subtree- O nodes ] History # preorder traversal can be divided as [root, left- subtree-nodes, right- subtree- nodes ] def reconstructBT (preorder, inorder ) : return Helpclass BinaryTreeNode: def init_(self, data) : self . val = data self . left = None self . right = None