MCQ Bank

Which data structure would most efficiently implement an undo feature in a text editor?

A hash function should ideally distribute keys:

A binary search tree becomes degenerate (skewed) when elements are inserted in:

Which data structure is best suited to model a first-come-first-served print queue?

A hash map storing key-value pairs provides average-case constant time for which operation?

A stack can be used to check whether a string of parentheses is:

The infix expression A + B * C, respecting operator precedence, is equivalent to which postfix expression?

The minimum number of nodes in an AVL tree of height h grows according to a recurrence resembling which sequence?

In a circular linked list, the last node's next pointer points to:

A weighted graph is one in which:

The number of edges in a tree with n nodes is always:

A binary heap is most commonly stored using which underlying structure?

A graph is called complete when:

A skip list improves search performance over an ordinary linked list by:

In a min-heap the smallest element is always located at the:

A hash table using open addressing with linear probing resolves a collision by:

A disjoint-set (union-find) data structure with path compression and union by rank supports operations in nearly:

A self-referential structure is one that contains:

The postfix (Reverse Polish) expression 3 4 + 5 * evaluates to:

Which traversal visits the root node last, after both subtrees?