Deliverables 2. The requested solution one-line answer for tree traversal a. In order traversal b. Preorder traversal c. Postorder traversal

2. Based on the lecture slides, a traversal of a tree T is a systematic way of accessing, or visiting, all the positions (nodes) of Tree. (a) Preorder traversal: Sequence of visiting nodes preorder traversal: (Root, Left, Right) - Visit the node - Call itself to traverse the nodes left subtree - Call itself to traverse the nodes right subtree (b) Postorder traversal: Sequence of visiting nodes in postorder traversal: (Left, Right, Root) - Call itself to traverse the nodes left subtree - Call itself to traverse the nodes right subtree - Visit the node (c) Inorder traversal: Sequence of visiting nodes in inorder traversal: (Left, Root, Right) - Call itself to traverse the nodes left subtree - Visit the node - Call itself to traverse the nodes right subtree. Write the preorder, postorder and inorder traversal of the following tree