how to implement stack operation using singly linked list

Answer Posted / spandana

it is a datastructure which follows the principal of Last
in First order(LIFO) ie last inserted element will be
deleted first.hence both insertions and deletions takes
place at the same end.it can perform 2
operations "PUSH","POP". the special variable used in
stacks is "top"
stacks can be implemented using arrays,linked lists

Is This Answer Correct ?    2 Yes 1 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

a construct the"else" part of "if" statement contains anoth "if else" statement is called a) if-else b) else-if-else c) if-else-if-else d) chain if/if-else-if

709


what does static variable mean?

657


What is struct node in c?

624


What is an array? What the different types of arrays in c?

662


What is a pointer variable in c language?

649






What is the difference between functions getch() and getche()?

625


Why is not a pointer null after calling free?

600


How can I find the modification date of a file?

708


What are derived data types in c?

617


write a c program thal will find all sequences of length N that produce the sum is Zero, print all possible solutions?

2415


Explain the process of converting a Tree into a Binary Tree.

2110


What is variable declaration and definition in c?

505


What is the total generic pointer type?

731


When should the register modifier be used? Does it really help?

621


Explain indirection?

650