Python 3

Name: We studied in class that "pre-order traversal" is an ordering where we process the root, then the left subtree, then the right subtree. Let's define a new ordering called "reversed pre-order Question #2 traversal, which processes the root, then the right subtree, then the left subtree. Whar's the revernsed pre-order traversal for the following tree? (3 points) Complete the function reversedPreOrder) to take a root node of a tree and print the tree using the reversed pre-order traversal we just defined. (11 points) def reversedPreOrderCroot)