What is the worst case time complexity for search, insert and delete operations in a general Binary Search 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
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.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.