1. ► Nested function calls form a stack

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

3. ► Stacks have LIFO ordering

4. ► priority_queue forms the basis of many algorithms

5. ► Queue can be implemented using a list

6. ► Only top element can be accessed in stack

7. ► priority_queue’s priority function cannot be changed

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

9. ► A queue has FIFO ordering

10. ► STL stack uses deque to implement stack