3. Binary Tree Traversals. (10 pts) Consider the following tree. 10 F?II in each of the traversals below : Preorder traversal: Inorder traversal: Postorder traversal: For each traversal put/add the values in an imaginary Stack and a Queue after they are read from the tree. After traversing the tree, write down the contents of the Stack or Queue: F?II in each of the traversals below : Preorder traversal put in Queue: Inorder traversal put in Queue: Postorder traversal put in Queue: Preorder traversal put in Stack: Inorder traversal put in Stack: Postorder traversal put in Stack