Please CREATE and COMMENT the code in python. Please note: you need to use try-except block whenever the need arises for any of the following questions. Dont use tree or linked lists related libraries. Thank you

Your task is to create a binary Tree of digits from O to 9 using user inputs. Then display the tree using in-order traversal. Next, your task is to iterate through the tree from the root to the leaf nodes and print the path. You also need to sum up all the paths in it as shown in the example. Create appropriate class and functions. 4. Example: User Inputs # 1 Inorder traversal: 3,0,1,1,4 Paths: 1->e 3 1-4 sum of all paths: 103 + 101 + 14 = 218 Explanation: Path traced would be from root to leaf nodes. Sum is the additions of all paths Hint: for user input, ask for root, left and right node values respectively. If no value needs to be assigned, you can use None