New Enroll here to Join NaBFID Analyst Into Class on May 6

    Question

    In a binary search tree (BST), what is the time

    complexity of finding the maximum element in the tree?  
    A O(log n) Correct Answer Incorrect Answer
    B O(n) Correct Answer Incorrect Answer
    C O(1) Correct Answer Incorrect Answer
    D O(n log n) Correct Answer Incorrect Answer

    Solution

    O(log n)

    Practice Next

    Relevant for Exams: