In a Binary Tree, if a node has no left child, what does its inorder predecessor represent during threaded conversion?
In a threaded binary tree, a NULL left pointer is replaced by a thread pointing to the node's inorder predecessor in the traversal sequence.
What is the time complexity of finding the minimum element in a valid Max Heap of size n?
In a Max Heap, the minimum element must reside in one of the leaf nodes (which occupy indices ⌊n/2⌋ + 1 to n). Searching across ⌈n/2⌉ leaves requires O(n) time.
What is the result of applying Heapsort on an array of n elements?
Heapsort builds a max heap in O(n) time and repeatedly extracts the max to the array tail, sorting in O(n log n) time and O(1) auxiliary space.
Which traversal of an expression tree evaluates each sub-expression before its parent operator?
Postorder traversal visits the left and right operand subtrees before visiting the root operator, so it evaluates each sub-expression before its parent operator. This is also the traversal used to obtain postfix notation.
Which statement correctly gives the maximum number of edges in a tree with n nodes?
Every tree with n nodes has exactly n - 1 edges. Since n - 1 is not among A-C, the correct choice is None of the above.