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

A Insertion
B Deletion
C Searching for a value
D All of the above
Share this MCQ

Learn More MCQ Questions from Data Structure Tree

This set of multiple choice questions (MCQs) covers various concepts related to trees in data structure. Test your knowledge and improve your understanding of binary trees, binary search trees, AVL trees, red-black trees, and more.