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%)
阿摩線上測驗
登入