問題詳情

5.A binary tree has 8 nodes. Given the inorder and postorder traversal of the tree, please dr aw the tree.  Postorder: FECHGDBA. Inorder: FECABHDG. Draw a diagram showing how this binary tree appears in memory when stored without pointers using a block o! contiguous memory cells. Here assume that each character is encoded by one byte. (20%)

參考答案

答案:A
難度:簡單0.888658
統計:A(1708),B(93),C(0),D(121),E(0)

內容推薦

內容推薦