Please CREATE and COMMENT the code in python. Thank you

Please Note: You need to use try-except block wherever the need arises for any of the following questions. Do not use Tree, Linked List related libraries 1. Your task is to re-create a binary tree using a pre-order and n-order traversal lists provided. You may need to create a class structure for Tree. At the end, you need to print the tree content using post-order tree traversal mechanism. Those not aware of binary tree and tree traversal may read it using the following hyperlink. Binary Tree Tree Traversal Example: Inorder traversal: [4, 2, 1, 5, 3, 6] Preorder traversal: [1, 2, 4, 3, 5, 6] Solution: 1 1 Post-order traversal: 4,2,5,6,3,1