Explain the term stack operation
Explain the term stack operation. Also write some of its operations.
Expert
The Stack is a data structure which follows Last in First out strategy.
Stack Operations are as follows:
Push: It pushes (inserts) the element in the stack. The location is specified through the pointer.
Pop: It pulls (eliminates) the element out of the stack. The location is specified through the pointer.
Swap: It is the two top most elements of the stack can be swapped.
Peek: It returns the top element on the stack however doesn’t remove it from the stack.
Rotate: It is the topmost (n) items which can be moved on the stack in a rotating fashion.
The stack has a fixed location in the memory. Whenever a data element is pushed in the stack, the pointer points to the present element.
Explain binary tree in brief.
Explain about the threaded binary tree and its common uses.
Describe the term two-dimensional array by using example?
Explain the uses of Linked list.
Write down some of the limitations of arrays?
Write a brief note on the term data structure? And also write down the types of data structures?
Define software engineering?
What do you mean by B+ tree? Describe some of its uses.
Explain the queue operation in brief.
What is white box testing?
18,76,764
1955051 Asked
3,689
Active Tutors
1430839
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!