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.
Illustrates the difference between ARRAY and STACK?
Define the types of an algorithm.
Define the use of Direct Access in linked list instead of an array or vice versa.
Define when we should use plain list.
Illustrate the difference between the stack and Queue in brief?
What do you mean by spanning Tree?
What are the uses of binary tree?
Write some of the disadvantages of the sequential storage?
Explain how can I search for data in the linked list?
What do you mean by Huffman algorithm?
18,76,764
1921927 Asked
3,689
Active Tutors
1418027
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!