arrow_back
Back to all chapters
Total: 2 Questions
Question 1
Which data structure operates on a Last In First Out (LIFO) basis?
Correct Option: B
Explanation:
A Stack uses the LIFO method, where the last element inserted is the first one to be removed.
Question 2
What is the time complexity of searching an element in a balanced Binary Search Tree (BST) in the worst case?
Correct Option: B
Explanation:
In a balanced BST, search takes logarithmic time O(log n).