1. ► A queue has FIFO ordering

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

3. ► Nested function calls form a stack

4. ► Only top element can be accessed in stack

5. ► priority_queue’s priority function cannot be changed

6. ► Queue can be implemented using a list

7. ► priority_queue forms the basis of many algorithms

8. ► STL stack uses deque to implement stack

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

10. ► Stacks have LIFO ordering