Construct an inorder traversal function that recursively traverse a tree from left node, root node and right node. We store the traversed tree in a list called res=[]. The traversal function is inside of the tree class. Consider the tree class has been predefined.