Interested to Buy Any Domain ? << Click Here >> for more details...
how to implement stack operation using singly linked list
- 2 Answers
- 6921 Views
- I also Faced
- E-Mail Answers
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 |
Write a program of prime number using recursion.
print ur name without using any semicolon in c/c++....
21 Answers Bosch, TCS, Wipro,
why do we use # in c-language?
Write a program to print this triangle: * ** * **** * ****** * ******** * ********** Don't use printf statements;use two nested loops instead. you will have to use braces around the body of the outer loop if it contains multiple statements.
how to write a data 10 in address location 0x2000
What is difference between scanf and gets?
what does exit() do?
What is the purpose of ftell?
Explain how can you check to see whether a symbol is defined?
Tell me what is null pointer in c?
What is the use of a static variable in c?
YBJBU6
C 
