Exam 13: Advanced Implementations of Tables

A node in a red-black tree requires less storage than a node in a 2-3-4 tree.

A 2-3 tree is never taller than a minimum-height binary tree.

In a 2-3-4 tree,a leaf may contain ______ data items.

Insertions and deletions on a 2-3 tree requires fewer steps than insertions and deletions on a 2-3-4 tree.

The condition that occurs when a hash function maps two or more distinct search keys into the same location is called a(n)______.

In a 2-3 tree,a leaf may contain ______ data item(s).

In a 2-3 tree,how is the search key of a 2-node related to the search keys in the left subtree and the right subtree of the 2-node?

What are the two types of approaches for resolving collisions in a hash table design?

What makes 2-3-4 trees more attractive than 2-3 trees?

What are the two types of rotations possible in an AVL tree?

Suppose we have already inserted the values 5,10 and 15 into an empty 2-3-4 tree.Explain what happens when we insert the value 20 into this tree.

What is a perfect hash function?

A 2-3-4 tree is always balanced.

A 4-node contains ______ data item(s).

A red-black representation of a 2-3-4 tree is unique.

______ is a collision-resolution scheme that searches the hash table sequentially,starting from the original location specified by the hash function,for an unoccupied location.

In a 2-3 tree,how is the search key of a 3-node related to the search keys in the left subtree,the middle subtree,and the right subtree of the 3-node?

In a 4-node,the largest search key is found in the ______ subtree.

A 2-3 implementation of a table is ______ for all table operations.

Suppose we want to delete a node from an AVL tree.If this node does not have any children,is it possible that removing this node would require us to perform a rotation operation? Explain.