Data Structures Review

Front

Quick Sort runs in O(n) if all elements are equal.

Back

True

Front

Binary search is an example of binary recursion

Back

False

Front

Bucket sort is always better than quick sort because it has linear time complexity.

Back

False

Front

Let n be the number of elements in the stack. The push method of the stack runs in

Back

O(1)

Front

The space usage of ArrayQueue is O(n) where n is the number of elements in the queue.

Back

False

Front

One of these is not a method from the Positional List ADT: addFirst(p, e), addBefore(p, e), set(p, e), addAfter(p, e)

Back

addFirst(p, e)

Front

The return type of the 'set' method of Positional List is

Back

E

Front

The remove method of Linked Positional List runs in O(n) time, where n is the size of the list, because we need to shift the positions after the removal. True or False?

Back

False

Front

Let n be the number of nodes in an Array-Based Binary Tree. The running time of removing a node is

Back

O(n)

Front

A binary tree with nodes that have either zero or two children, is called

Back

proper