[Q.16] What is the worst-case time complexity of Quick Sort algorithm?
Quick Sort worst-case time complexity is O(n^2) when the pivot selected is consistently extreme.
[Q.17] Which data structure is used to implement Breadth-First Search (BFS) on a graph?
BFS uses a FIFO Queue to traverse graph nodes level by level.
[Q.18] What is the time complexity of searching an element in a balanced Binary Search Tree (BST) with n nodes?
In a balanced BST, tree height is $\log(n), making search complexity O(log n)$.
[Q.19] An expression of the form '+ A * B C' is known as:
Prefix (Polish) notation places the operator before its operands.
[Q.20] Which data structure follows the Last-In, First-Out (LIFO) property?
A Stack operates strictly under LIFO order.