how to implement stack operation using singly linked list
- 2 Answers
- 6083 Views
- I also Faced
- E-Mail Answers
Answer Posted / vignesh1988i
we know that stack is a data structure where the
highest priority will be given to the last element that is
pushed inside and the priority will decrease respectively to
the next consecutive elements........ so we are going to
implement in singly list .... so we are going to insert the
node to the left side of a reference node....... operations
performed in stack are : PUSH & POP..... PUSH here means we
are going to insert a element only at last ..... and POP
means displaying the node from first........
thank u
| Is This Answer Correct ? | 9 Yes | 1 No |
Post New Answer View All Answers
How can you increase the size of a dynamically allocated array?
if the area was hit by a virus and so the decrease in the population because of death was x/3 and the migration from other places increased a population by 2x then annually it had so many ppl. find our the population in the starting.
What is bubble sort technique in c?
When should the volatile modifier be used?
Explain how can I prevent another program from modifying part of a file that I am modifying?
Explain how many levels deep can include files be nested?
hi, which software companys will take,if d candidate's % is jst 55%?
Explain the properties of union.
What is #define in c?
What is the difference between strcpy() and memcpy() function in c programming?
Explain why c is faster than c++?
write a program to find the given number is prime or not
program to find error in linklist.(i.e find whether any node point wrongly to previous nodes instead of next node)
What is void main () in c?
What is 02d in c?
