I had an experience changing code from using priority queue using finger tree to using sorted lists (regular Haskell&#x27;s lazy lists, sorted, not even merged!) and obtaining an order of magnitude speedup and reduction of memory consumption.<p>So I would like to advise staying away from finger trees and other interesting data structures when lists suffice.<p>In case of queues they are very sufficient.<p>What article lacks, is the performance comparisons.