[Q.31] What is the average-case search time complexity in a Hash Table with good hash distribution?
Hash tables achieve O(1) average lookup time via direct bucket indexing.
[Q.32] Which of the following tree traversals visits nodes in non-decreasing order for a Binary Search Tree (BST)?
In-order traversal (Left, Root, Right) of a BST retrieves keys in sorted ascending order.
[Q.33] The Minimum Spanning Tree (MST) of a connected weighted graph can be constructed using:
Kruskal's Algorithm (and Prim's) builds a Minimum Spanning Tree for a connected weighted graph.
[Q.34] What is the height of an AVL tree with n nodes?
An AVL tree maintains height balance ($\delta <= 1), keeping height strictly O(log n)$.
[Q.35] Topological sorting can be performed on which type of graph?
Topological ordering exists if and only if the directed graph contains no cycles (DAG).