Insert
Add
Push
None of the above
Underflow
Garbage collection
Overflow
String reversal
Recursion
Backtracking
Asynchronous data transfer
Queue
Stack
Binary tree
Linked list
A+B*C
+A*BC
ABC+*
A+(BC*)
+AB*C
Arrays can be used to implement the stack
Stack follows FIFO
Elements are stored in a sequential manner
Top of the stack contains the last inserted element
1234
2134
4321
First node
Second node
Last node
Create
Evaluation
Pop
Delete
Drop
POP
Extract
Array
Tree
Linked List
AB+ CD*E – FG /**
AB + CD* E – F **G /
AB + CD* E – *F *G /
AB + CDE * – * F *G /
*AB/CD+
AB*CD/+
A*BC+/D
ABCD+/*
Branch
-/*^ACBDE
-ABCD*^DE
-A/B*C^DE
-A/BC*^DE
CISC
RISC
Parallel
