問題詳情

1. Suppose that we use struct node to represent binary trees, and use function unknown to process a binary tree.



【題組】(1) Which order does function unknown(r) use to traverse the tree with root node pointed by the pointer r?
(A) preorder
(B) inorder
(C) postorder
(D) level order
(E) None of the above.

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增