Given a complete binary search tree consisting of 15 elements, the height of the tree is:

A.  15
B.  8
C.  7
D.  3

The following pseudocode, which has a worst-case timing of $$O(n^2)$$, is what type of classical sort algorithm? 

A.  Bubble sort
B.  Insertion sort
C.  Merge sort
D.  Quick sort

The final value of Q in the following flowchart is most nearly:

A.   0
B.   1
C.   3
D.   5

The following function counts down starting at Y. What number does the countdown return if it is called with Y= 10?

A.   -1
B.   0
C.   1
D.   10