1. ► Stacks have LIFO ordering

2. ► Queue can be implemented using a list

3. ► A queue has FIFO ordering

4. ► priority_queue forms the basis of many algorithms

5. ► Only top element can be accessed in stack

6. ► priority_queue’s priority function cannot be changed

7. ► An element of the priority queue can be accessed only in O(n) time

8. ► Nested function calls form a stack

9. ► STL stack uses deque to implement stack

10. ► Accessing top element in stack is constant time operation