2. Suppose we have a tree where the left subtree of its root contains 2500 nodes and the right
subtree contains 200 nodes. How many nodes are processed before the root node for the
post-order traversal?
(A) cannot be determined;
(B) 2500;
(C)200;
(D) 2700.