問題詳情

5.The order of the nodes visited in a binary tree T using preorder traversal is F, A, H,I,B, L,J,E, D,G, K, C, M. If inorder traversal is used, it isH, I,A, L,B,J, F, D, G, E, K, M, C. Please draw the binary tree T. (20%)

參考答案

答案:B
難度:簡單0.867046
統計:A(421),B(3202),C(35),D(35),E(0) #
個人:尚未作答書單:換算

內容推薦

內容推薦