問題詳情

b.What is the output key sequence when doing a postorder traversal of the binary search tree? (Hint: The height of a tree is the number of nodes on the longest path from the root to a leaf.)

參考答案

答案:C
難度:適中0.691552
統計:A(8),B(72),C(352),D(24),E(0)

內容推薦