Deck 12: Heaps and Priority Queues

Question 1

A _________ search tree can have more than two children per node and can store more than one element in each node.

A) Multi-way
B) Binary
C) Linked
D) None of the above

Answer 1

Multi-way

Question 2

A _____ tree contains nodes that contain either one or two elements and have zero, two, or three children.

A) 2-4
B) B
C) 2-3
D) B*

Answer 2

2-3

Question 3

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
B) height
C) type
D) None of the above

Answer 3

height

Question 4

If the propagation effect of a 2-3 tree insertion causes the root to _________, the tree increases in height.

A) Split
B) Be deleted
C) Rotate
D) None of the above

Question 5

A 2-4 tree expands on the concept a 2-3 tree to include the use of _________.

A) 2-nodes
B) 3-nodes
C) 4-nodes
D) None of the above

Question 6

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
B) B
C) 2-3
D) B*

Question 7

Access to ____________ storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

A) recent
B) cache
C) secondary
D) cloud

Question 8

___________ 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
B) Stacks
C) Queues
D) Arrays

Question 9

A multi-way search tree can have more than ____ children per node and can store more than one element in each node.

Question 10

A ______ tree contains nodes that contain either one or two elements and have zero, two, or three children.

Question 11

If the ______ effect of a 2-3 tree insertion causes the root to split, the tree increases in height.

Question 12

A ______ tree expands on the concept a 2-3 tree to include the use of 4-nodes.

Question 13

A ______ extends the concept of 2-3 and 2-4 trees so that nodes can have an arbitrary maximum number of elements.

Question 14

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as ______.

Question 15

Arrays may provide a better solution both within a B-tree ______ and for collecting B-tree nodes because they are effective in both primary memory and secondary storage.

Question 16

A multi-way search tree can have more than two children per node and can store more than one element in each node.

Question 17

A 2-3 tree contains nodes that contain either one or two elements and have zero, two, or three children.

Question 18

If the propagation effect of a 2-3 tree insertion causes the root to split, the tree decreases in height.

Question 19

A 2-4 tree expands on the concept a 2-3 tree to include the use of 4-nodes.

Question 20

A 2-3 tree extends the concept of 2-4 trees so that nodes can have an arbitrary maximum number of elements.

Question 21

Access to secondary storage is very slow relative to access to primary storage, which is motivation to use structures such as B-trees.

Question 22

Linked lists 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.

Question 23

Describe the nodes in a 2-3 tree.

Question 24

When does a node in a 2-3 tree split?

Question 25

How can splitting a node in a 2-3 tree affect the rest of the tree?

Question 26

Describe the process of deleting an element from a 2-3 tree.

Question 27

Describe the nodes in a 2-4 tree.

Question 28

How do insertions and deletions in a 2-4 tree compare to insertions and deletions in a 2-3 tree?

Question 29

When is rotation no longer an option for rebalancing a 2-3 tree after a deletion?