Exam 9: Self-Balancing Search Trees

A(n) ____ tree is made up of nodes designated as 2-nodes and 3-nodes.

A(n) ____________________ extends the idea behind the 2-3 and 2-3-4 trees by allowing a maximum of CAP data items in each node.

All nodes in a skip-list have the same number of links.

The Java API has a(n) ____________________ class that implements a Red-Black tree.

The height of a 2-3 tree is between ____.

A(n) ____________________ tree is one in which the root and the left subtree of the root are both left-heavy.

The following is the algorithm for ____.

All the leaves of a 2-3 node are at the lowest level.