Vidyalelo
Data Structure · Q167

Introduction to Data Structures

Programming · Data Structure · question 167

Q167

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 Dequeue operation. Each element in the array is touched atleast?

A.
Once
B.
Twice
C.
Thrice
D.
Four times
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board