1. ► Only top element can be accessed in stack

2. ► Queue can be implemented using a list

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

4. ► A queue has FIFO ordering

5. ► STL stack uses deque to implement stack

6. ► Stacks have LIFO ordering

7. ► Nested function calls form a stack

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

9. ► priority_queue forms the basis of many algorithms

10. ► priority_queue’s priority function cannot be changed