2. red-black tree 是一個 binary search tree,每個 node 不是 red 就是 black, root node 和每個 leaf node 必須是 black, 列出其他 red-black 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?