Given an array of size n, let’s assume an element is ‘touched’ if and only if some operation is performed on it(for example, for performing a pop operation the top element is ‘touched’). Now you need to perform a Dequeue operation. Each element in the array is touched at least?
(a) Once
(b) Twice
(c) Thrice
(d) Four times
Select the correct answer from above options
Data Structures and Algorithms questions and answers