問題詳情
2. Suppose we have a tree where the left subtree of its root contains 2500 nodes and the rightsubtree contains 200 nodes. How many nodes are processed before the root node for thepost-order traversal?
(A) cannot be determined;
(B) 2500;
(C)200;
(D) 2700.
參考答案
答案:[無官方正解]
難度:計算中-1
書單:沒有書單,新增