Open In App
Related Articles

GATE | GATE CS 2013 | Question 7

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? (A) O(1) (B) O(Logn) (C) O(n) (D) O(nLogn)

Answer: (C)

Explanation: To insert an element, we need to search for its place first. The search operation may take O(n) for a skewed tree like following.
To insert 50, we will have to traverse all nodes.
        10
         \
          20
            \
             30
               \
                40


Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads