What is the maximum number of search keys in a B-Tree node of order m, under the convention that a node has at most m children?
Under the stated order-m convention, a node has at most m child pointers and therefore at most m - 1 separator/search keys.
What type of tree guarantees that the key stored at any node is greater than or equal to keys of its children?
By definition, a Max Heap satisfies the heap property where key(parent) >= key(child) for every non-root node.
Which statements about a binary tree with n nodes are correct?
All three statements are correct. A tree with n nodes has n - 1 edges, so n - 1 child pointers are non-NULL. From 2n total child-pointer fields, the remaining n + 1 are NULL.
In a Red-Black Tree, what is the maximum possible ratio between the longest root-to-leaf path and the shortest root-to-leaf path?
Red-Black Tree properties mandate that no path has two consecutive red nodes and all paths contain the same number of black nodes. Hence, the longest path is at most twice the shortest path.
Which traversal of an expression tree produces the postfix (Reverse Polish) form of the expression?
Postorder visits the left operand, right operand, and then the operator. This is exactly the ordering used by postfix notation, so an expression tree is converted to postfix by postorder traversal.