Open In App
Related Articles

Data Structures | Binary Search Trees | Question 1

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree for a skewed tree ?

(A)

O(n) for all

(B)

O(Logn) for all

(C)

O(Logn) for search and insert, and O(n) for delete

(D)

O(Logn) for search, and O(n) for insert and delete



Answer: (A)

Explanation:

In skewed Binary Search Tree (BST), all three operations can take O(n). See the following example BST and operations.

          10
        /
       20
      /
     30
    / 
   40

Search 40. 
Delete 40
Insert 50.


Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 02 Feb, 2013
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads