- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Data Structures | Binary Search Trees | Question 1
Last Updated :
Discuss
Comments
What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree for a skewed tree ?
O(n) for all
O(Logn) for all
O(Logn) for search and insert, and O(n) for delete
O(Logn) for search, and O(n) for insert and delete
This question is part of this quiz :
Top MCQs on Binary Search Tree (BST) Data Structure with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy