help with data structures multiple choice

6. Nodes for a doubly linked list are defined to have the following structure 8. Which of the following sorting algorithms does not require On2) steps in the worst case? data A.insertion sort B. election sort C. heap sort D. quicksort The next instance variable stores a reference to the next node in the list, and the prev instance variable refers to the previous node in the list Below is a list of three of these nodes, along with two reference variables, n and p, that refer to specific nodes in the list. 9. An array of 7 integers is being sorted by the heapsort agorithm. After the initial phase of the algorithm (constructing the heap), which of the following is a possible ordering for the array? A. 85 78 45 51 53 47 49 B. 85 49 78 45 47 51 53 C 85 78 49 45 47 51 53 D. 45 85 78 53 51 49 47 E. 85 51 78 53 49 47 45 10. The binary search tree shown below was constructed by inserting a sequence of Which of the following expressions does not refer to the third node in the list? tems into an empty tree. D. pnext-prev-next 12 7. Consider the following recursive method: 20 Public int recurse(int a, int b) if(a % b-2) Which of the following input sequences will not produce this binary search tree? return a else A. B. C. D. E. 5349127 8620 5937684 12 20 597 86 12 20 34 597 38 126 4 20 5936784 12 20 return recurse (a + b, a-b); What is returned by the call recurse(7, 2)? A. 5 B. 7 D. 14 E. 18