Which condition causes an Underflow error during a Dequeue operation on a Linked List Queue?
A queue underflow occurs when trying to remove an element from an empty queue, indicated by front == NULL.
In a binary search tree, what is the inorder successor of a node that possesses a non-empty right subtree?
When a BST node has a right subtree, its inorder successor is found by moving to the right child and then following left pointers down to the minimum node.
What is the main reason why Skip Lists are used as an alternative to AVL/Red-Black Trees?
Skip Lists rely on simple random coin flips for level promotion, avoiding complex tree rotation algorithms required by AVL and Red-Black trees.
In an expression tree representing (A + B) * C, which node resides at the root of the tree?
The operator with the lowest precedence at top level is executed last. Here, '*' multiplies (A+B) and C, making '*' the root operator node.
Which statement correctly describes the height of a balanced AVL tree with n nodes?
An AVL tree has height Θ(log n), so none of A-C gives the correct asymptotic height.