題組內容

4.Hash table and binary search tree (BST) are two fundamental data structures for search.

a. (10 points) Give the time complexities of hash table and BST in search and insertion.