Describe stack operation
Briefly describe the term stack operation?
Expert
Stack is a data structure which follows Last in First out strategy.
Stack Operations:-
• Push – Pushes (inserts) the element in stack. The location is specified by pointer. • Pop – Pulls (removes) the element out of stack. The location is specified by pointer • Swap: - the two top most elements of stack can be swapped • Peek: - Returns top element on stack but doesn’t remove it from the stack • Rotate: - the topmost (n) items can be moved on stack in a rotating fashion
A stack has a fixed location in the memory when a data element is pushed in stack, pointer points to the current element.
Write a brief note on the term data structure? And also write down the types of data structures?
Elucidate pre-order and in-order tree traversal?
How is the front of the queue computed?
Specify the methods which are available in the storing sequential files?
Explain the queue operation in brief.
When should we use Space in linked list instead of an array or vice versa?
Run Time Memory Allocation is termed as?
In a linked list how can I search for data?
Explain about the Huffman algorithm.
What are the differences between data structure of System R and the relational structure?
18,76,764
1923181 Asked
3,689
Active Tutors
1424407
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!