1. ► A queue has FIFO ordering

2. ► priority_queue forms the basis of many algorithms

3. ► priority_queue’s priority function cannot be changed

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

5. ► Stacks have LIFO ordering

6. ► Only top element can be accessed in stack

7. ► Queue can be implemented using a list

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

9. ► STL stack uses deque to implement stack

10. ► Nested function calls form a stack