how to implement stack operation using singly linked list
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / 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 |
What is a program flowchart?
When I tried to go into a security sites I am denied access and a message appeared saying 'applet not initialize'. How can I rectify this problem.
What is the method to save data in stack data structure type?
What is break in c?
There is a practice in coding to keep some code blocks in comment symbols than delete it when debugging. How this affect when debugging?
what is the importance of spanning tree?
What is bubble sort technique in c?
What are the 32 keywords in c?
. Explain the differences between fork() and exec() in C
How can I write functions that take a variable number of arguments?
How can I list all of the predefined identifiers?
Describe the modifier in c?