The main function to construct Full Binary Tree from given preorder and postorder traversals . This function mainly uses constructTreeUtil ( )
def constructTree ( pre : list , post : list , size : int ) -> Node : NEW_LINE INDENT global preIndex NEW_LINE return constructTreeUtil ( pre , post , 0 , size - 1 , size ) NEW_LINE DEDENT