I can't answer this question. It seems simple but I really don't know how to approach it. Here it is:
A priority queue is said to be stable if deletions of items with equal priority value occur in the order in which they were inserted. Which of the following priority queue structures are stable:
- linked lists ordered in increasing priority (key)
- balanced search trees (e.g., 2-3 trees)
- leftist heaps
Explain why, or give counter-examples.
I don't need a full solution just a way to approach this problem. I would prefer to solve it on my own.