šŸ“¢ Too many exams? Don’t know which one suits you best? Book Your Free Expert šŸ‘‰ call Now!


    Question

    What is the time complexity of searching in a balanced

    binary search tree?
    A O(1) Correct Answer Incorrect Answer
    B O(log n) Correct Answer Incorrect Answer
    C O(n) Correct Answer Incorrect Answer
    D O(n log n) Correct Answer Incorrect Answer
    E O(√n) Correct Answer Incorrect Answer

    Solution

    In balanced BSTs like AVL or Red-Black trees, height is log n, giving logarithmic search time.

    Practice Next
    ask-question