Question 1
The average-time complexity for quick sort is ________.
◦ O(n)
◦ O(n*n)
◦ O(nlogn)
◦ O(1)
◦ O(logn)
Question 2
Which of the following statements are true?
◦ Each node is greater than or equal to any of its children.
◦ A binary tree is complete if every level of the tree is full except that the last level may not be full and all the leaves on the last level are placed left-most.
◦ A heap is a complete binary tree.
◦ A heap is a full binary tree.