The order condition that characterizes a heap states that

A) at each node X, any element stored in a child of X must be greater than the element stored at X
B) at each node X, any element stored in a left child of X must be less than the element stored at X, and any element stored in right child must be greater than the element stored at X
C) an inorder traversal of the heap's binary tree must yield a sorted sequence
D) None of the above

A) at each node X, any element stored in a child of X must be greater than the element stored at X