Please answer all of them

COMP 1006/1406- Summer 2018 Sample Final oot 10 11 12 13 14 15 16 17 Use this binary tree for all questions on this age. The root node is the node with 1 in it. Which of the following would access the node with value 12? (a) root.right.right.left (b) root.left.right.right (c) root.right.right.left 13) Which of the following is a preorder traversal of the tree? (a) 8, 4, 14,9, 2, 5, 15, 10, 16, 1, 6, 11, 3, 17, 12, 7, 13 (b) 1, 2, 4, 8, 9, 14, 5, 10, 15, 16, 3, 6, 11, 7, 12, 17, 13 (e) 8, 14, 9, 4, 15, 16, 10, 5, 2, 11, 6, 17, 12, 13, 7, 3,1 14) Consider the sequence 8, 14, 9, 4, 15, 16, 10, 5, 2, 11, 6, 17, 12, 13, 7, 3, 1. Which of the following traversals of this tree would produce this sequence? 15) (a) preorder traversal (b) inorder traversal (c) postorder traversal 16) In an inorder traversal of a binary tree when is the root node printed? (a) the root is the first value printed (b) the root is roughly the middle value printed (c) the root is the last value printed