A. Deletion from Queue
B. Worst case search in binary search tree
C. Insertion in stack
D. Quick sort worst case
Options:
(a) C, D
(b) A, C
(c) A, B
(d) B, C
Deletion from Queue → O(1)
Worst case search in Binary Search Tree → O(n)
Insertion in Stack → O(1)
Quick Sort worst case → O(n2)
Same order complexity:
Deletion from Queue and Insertion in Stack → O(1)
Correct Answer: (b) A, C
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.