Interested to Buy Any Domain ? << Click Here >> for more details...
how to implement stack operation using singly linked list
- 2 Answers
- 6940 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
What will be the outcome of the following conditional statement if the value of variable s is 10?
What is quick sort in c?
Differentiate between full, complete & perfect binary trees.
What is the need of structure in c?
A collection of functions,calls,subroutines or other data a) library b) header files c) set of files d) textfiles
Why does notstrcat(string, "!");Work?
Explain what is operator promotion?
How to write a code for implementing my own printf() and
scanf().... Please hep me in this... I need a guidance...
Can you give an coding for c... Please also explain about
the header files used other than #include
Explain how to reverse singly link list.
What does the file stdio.h contain?
What is data structure in c language?
simple program of graphics and their output display
What is use of bit field?
A float occupies 4 bytes in memory. How many bits are used to store exponent part? since we can have up to 38 number for exponent so 2 ki power 6 6, 6 bits will be used. If 6 bits are used why do not we have up to 64 numbers in exponent?
What does int main () mean?
