The operation to be performed on a stack using a linked list can be realized using the function A. delete front, insert rear B. insert front, delete rear C. delete front, insert front D. delete rear, insert rear

This question is related to Wipro Interview

Showing Answers 1 - 2 of 2 Answers

Sarada

  • Feb 24th, 2006
 

  • Stack is a Last in First Out (LIFO) data structure.
  • So, Insertion and Deletion are made at the same end i.e front end.
  • Any one option should be Insert front,Delete front for Answer.

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions