In the Master Theorem recurrence T(n) = 3T(n/2) + O(n), what is the asymptotic tight bound?
Here $a = 3$, $b = 2$, and f(n) = O(n). Since $n^{log_2$ 3} grows faster than n, Master Theorem Case 1 gives the tight bound T(n) = $\Theta(n^{log_2 3})$.
Which traversal of an expression tree evaluates each operator after its operand subtrees?
Post-order traversal visits the left subtree, then the right subtree, and finally the root. Thus, an operator is processed after its operands, which is the usual evaluation order for an expression tree.
What is the maximum height of a Red-Black tree with N internal nodes?
Due to Red-Black tree properties (no two red nodes adjacent, all paths have equal black height), height h <= 2 log2(N + 1).
In a B-Tree of order m (maximum m children per node), what is the minimum number of keys in every non-root node?
With order m defined as the maximum number of children, every non-root node has at least ceil(m/2) children and therefore at least ceil(m/2) - 1 keys.
Which data structure is primarily used to implement Depth First Search (DFS) on a graph?
DFS explores as deep as possible along each branch before backtracking, which naturally follows Last-In-First-Out (LIFO) order managed by a Stack (or function call stack).