Need help on the last question only. 3a)

Please

3. Binary Tree Traversals. (10 pts) Consider the following tree 1 61 111 Fill 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: Pill 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: 3a) Using the full IntTreeNode constructor, write one statement that creates the tree depicted above (6 pts). We did an example of this in class