110年 - 110 國立政治大學_碩士班招生考試_資訊管理學系/科技組:資料結構#102881

科目：研究所、轉學考(插大)-資料結構 | 年份：110年 | 選擇題數：0 | 申論題數：7

試卷資訊

所屬科目：研究所、轉學考(插大)-資料結構

選擇題 (0)

申論題 (7)

1. (15%) Insert the keys into a min heap one by one. Reconstruct the heap when it violates the heap order (for all node v, v.key ＞ v.parcnt.key). Show each step and the final result.

2. (15%) Insert the keys into a hash table that handles collision with double hashing. Let N=17. h(k) = k mod 17. d(k) = 13-k mod 13. Show cach step and the final result.

3. (15%) Insert the keys into an AVL tree one by one. Reconstruct the AVLL tree when it violates the AVL property (for all node v, I v.leftsubtree height - v .rightsubtree.height I ＜=1 ). Show each step and the final result.

1. (10%) that uscs the heap constructed in I.l

2. (15%) that uses the AVL tree constructed in I.3

1. (15%) that uses recursive call on the binary tree representation of the expression

2. (15%) that uses two stacks for operators and operands (values) rcspectively