MCQOPTIONS
Saved Bookmarks
| 1. |
What is the disadvantage of BST over the hash table? |
| A. | BST is easier to implement |
| B. | BST can get the keys sorted by just performing inorder traversal |
| C. | BST can perform range query easily |
| D. | Time complexity of hash table in inserting, searching and deleting is less than that of BST |
| Answer» E. | |