1. 舉例說明 AVL (Adelson-Velskii Landis) tree 與一般 Binary Search tree 針對搜尋時間上的優劣比較

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?