Question 2 (10 marks) Linked Data Structures: Answer both parts below. Part A (5 marks): The in-order traversal of a binary tree processes the nodes in the order AABB. The pre-order traversal of the same binary tree processes the nodes in the order ABAB. The post-order traversal of the same binary tree processes the nodes in the order BABA. Draw the tree below. O Part B 15 marks}: Which of the following can be efficiently implemented with a linked list? Stack, Queue, Min- Heap, and/or Max-Heap? Which is faster? Finding the largest value in an unsorted array or in a singly linked list sorted from smallest to largest? Explain