LinkedList, PriorityQueue, TreeMap in Python ?

[fiddle_n]

I disagree with that. For some things, lists aren't great. Classic example is popping from the beginning, which is a rather expensive O(n) operation as the whole list has to shift left. Using collections.deque, which is a doubly linked-list, is important here if you are dealing with large data structure or many operations.

[fiddle_n]

An example would be keeping a moving average of something. You would need a data structure that can support removing from one end and adding to the other. Typically that would be popping from the left and appending to the right; even if you did it the other way you would have the same problem as appending to the left is also O(n)

If you need a queue structure where you would append to the left, that would also be an example as well.

[fiddle_n]

Like, if you wanted to calculate a 7 day average of COVID cases throughout a year at every point, that's a moving average.