Brodal queue - sellout/data-structure-zoo GitHub Wiki

A Brodal queue can be implemented as either a persistent or mutable data structure. The persistent version is actually simpler and maintains the same time complexity.

operations

• [chop optimum](/sellout/data-structure-zoo/wiki/chop-optimum) – O(log n)
• [merge](/sellout/data-structure-zoo/wiki/merge) – O(1)
• [peek optimum](/sellout/data-structure-zoo/wiki/peek-optimum) – O(1)
• [pop optimum!](/sellout/data-structure-zoo/wiki/pop-optimum!) – O(log n)
• [push](/sellout/data-structure-zoo/wiki/push) – O(1)