MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What are the worst-case complexities of insertion and deletion of a key in a binary search tree? |
| A. | Θ(logn) for both insertion and deletion |
| B. | Θ(n) for both insertion and deletion |
| C. | Θ(n) for insertion and Θ(logn) for deletion |
| D. | Θ(logn) for insertion and Θ(n) for deletion |
| Answer» C. Θ(n) for insertion and Θ(logn) for deletion | |