CMSC 341 Midterm 2 Exam Verified Exam Questions and Answers Latest update 2026/2027

CMSC 341 Midterm 2 Exam
Verified Exam Questions and Answers Latest update 2026/2027

Question:
(True or False) An AVL tree is a better choice than a red-black tree if your data structure will
have more reads and writes than retrieves. -
Answer:
False

Question:
(True or False) In a balanced binary tree, the number of nodes grows exponentially with the
height. -
Answer:
True

Question:
(True or False) In a skew heap, Extract-Min runs in amortized O(1) time. -
Answer:
False (O(log n))

Question:
(True or False) Increasing load factor is a strategy for reducing the number of hash collisions. -
Answer:
False

Question:
(True or False) Under ideal conditions, hash tables perform their basic operations in constant
time -
Answer:
True

Question:
(True or False) A Red-Black tree implementation of a priority queue performs enqueue and
dequeue in O(log n) time. -
Answer:
True

, Question:
(True or False) Removing a node from a red-black tree may require (log n) trinode
restructurings. -
Answer:
False

Question:
(True or False) When extracting the maximum value from an array-based implementation of a
max-heap, we simply shift the elements of the array left after removing the maximum element. -
Answer:
False

Question:
(True or False) The depth of all red nodes in a red black tree must be the same. -
Answer:
False

Question:
(True or False) Priority queues dequeue the oldest item in the queue. -
Answer:
False

Question:
Ordered Map ADT -
Answer:
Stores key, value pairs

Insert and retrieve by key

Ordering by keys

Used to implement self-balancing BST (red-black tree)

Question:
Unordered Map ADT -