A _________ search tree can have more than two children per node and can
store more than one element in each node.
D. None of the above
A _____ tree contains nodes that contain either one or two elements and have
zero, two, or three children.
A. 2-4
Inserting an element into a 2-3 tree can have a ripple effect up the tree causing
the _______ of the tree to increase.
A. order
If the propagation effect of a 2-3 tree insertion causes the root to _________, the
tree increases in height.
D. None of the above
A 2-4 tree expands on the concept a 2-3 tree to include the use of _________.
A. 2-nodes
A __________ tree extends the concept of 2-3 and 2-4 trees so that nodes can
have an arbitrary maximum number of elements.
A. 2-4
Access to ____________ storage is very slow relative to access to primary
storage, which is motivation to use structures such as B-trees.
A. recent
___________ may provide a better solution both within a B-tree node and for
collecting B-tree nodes because they are effective in both primary memory and
secondary storage.
A. Linked lists
store more than one element in each node.
have zero, two, or three children.
tree increases in height.
nodes.
an arbitrary maximum number of elements.
Access to secondary storage is very slow relative to access to primary storage,
collecting B-tree nodes because they are effective in both primary memory and
secondary storage.
and can store more than one element in each node.
and have zero, two, or three children.
split, the tree decreases in height.
nodes.
an arbitrary maximum number of elements.
primary storage, which is motivation to use structures such as B-trees.
and for collecting B-tree nodes because they are effective in both primary
memory and secondary storage.
Describe the nodes in a 2-3 tree.
When does a node in a 2-3 tree split?
How can splitting a node in a 2-3 tree affect the rest of the tree?
Describe the process of deleting an element from a 2-3 tree.
Deletion from a 2-3 tree falls into one of three cases. Case 1, deletion of
an element from a 3-node leaf, means simply removing the element and
Describe the nodes in a 2-4 tree.
How do insertions and deletions in a 2-4 tree compare to insertions and
deletions in a 2-3 tree?
When is rotation no longer an option for rebalancing a 2-3 tree after a deletion?