(6) Suppose that we use a stack to transform an infix expression with m operands and n operators. What is the size of the stack?
(A) O(n/m)
(B) O(n)
(C) O(m+n)
(D)O(mn)
(E) None of the above.

答案:登入後查看
統計: 尚無統計資料

詳解 (共 1 筆)

#7101540
1. 題目解析 這道題目詢問使用堆疊(...
(共 917 字,隱藏中)
前往觀看
0
0