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.

7. [10%] Assume that a hash function (h(key)- key mod 8) is used for a chained hash table with linked lists, where linked lists can be used to handle the collision due to hash function. If we insert 10 items whose keys are 8, 9, 13, 17, 10, 15, 20, 16, 25 and 26 to an empty chained bash table with linked lists, what are the execution results of the hash table?

題組內容

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.

相關申論題

相關試卷