Given that the pushing sequence of a stack is {1, 2, ⋯ , n} and popping sequence is {p1, p2, ⋯ , pn}. If p2 = n, how many different possible popping sequences can we obtain?
A.
1
B.
2
C.
n-1
D.
n
手机使用
分享
复制链接
新浪微博
分享QQ
微信扫一扫
微信内点击右上角“…”即可分享
反馈
参考答案:
举一反三
【单选题】Which type of bank does not collect deposits from the public?