QWhich of the following operations can be performed in O(log n) time on a balanced binary search tree?

Choose the Best Option

Click any option to instantly check if you're correct.

• A Insertion ✔ ✖
• B Deletion ✔ ✖
• C Searching for a value ✔ ✖
• D All of the above ✔ ✖

Share This Question

Challenge a friend or share with your study group.

Related MCQ Questions