1. ► STL stack uses deque to implement stack

2. ► Stacks have LIFO ordering

3. ► Queue can be implemented using a list

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

5. ► Only top element can be accessed in stack

6. ► Nested function calls form a stack

7. ► priority_queue’s priority function cannot be changed

8. ► priority_queue forms the basis of many algorithms

9. ► A queue has FIFO ordering

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