consider a stack s;2,4,1,4,6,7 _,_,_ pop operation is performed until a perfect square in encounter how many pop operation will be to be performed?
Answers
Answered by
0
Answer:
7 pop operations would be applied
Similar questions