1.
Median-of-three partitioning is a way of choosing the _______ .
2.
In quicksort, for an array of N elements, the partitionIt() method will
examine each element approximately ______ times.
3.
True or false: You can speed up quicksort if you stop partitioning when the
partition size is 5 and finish by using a different sort.
4.
Insertion and deletion in a tree require what big O time?
5.
A binary tree is a search tree if
a.
every non-leaf node has children whose key values are less than (or equal
to) the parent.
b.
every left child has a key less than the parent and every right child has a
key greater than (or equal to) the parent.
c.
in the path from the root to every leaf node, the key of each node is
greater than (or equal to) the key of its parent.
d.
a node can have a maximum of two children.