In a binary search tree (BST), what is the time complexity of searching for an element in the average case?
Answer: Option B
Average time complexity in a balanced BST is O(log n).
1
Which data structure uses LIFO (Last In First Out) principle?
2
What is the time complexity of binary search in a sorted array?
3
Which data structure is used for implementing recursion?
4
Which sorting algorithm has the best average-case time complexity?
5
In which traversal is a binary tree processed in left-root-right order?
| Data Structures & Algorithms MCQs | Computers and IT |
| Computer Fundamentals MCQ | Operating System MCQs |
| MS Word MCQs | MS Excel MCQs |
| C Programming MCQs | Database MCQs |
| Computer Networking MCQs |