ProGrads 卷別
資料結構與演算法
選擇國立臺灣大學 2023 · 考試 · 第 14 題
考科資料結構
(5 points) Prefix, infix, and postfix: Which of the following statements is/are correct?
- (A)We can use a stack to convert an infix to postfix expression.
- (B)We can use a stack to convert a postfix to an infix expression.
- (C)We can derive a binary tree from its infix and prefix notations.
- (D)We can derive a binary tree from its infix and postfix notations.
- (E)We can derive a binary tree from its prefix and postfix notations.