You can use mutable data structures in Haskell but we strive to avoid it except where strictly necessary. To find the "Haskell" version it suffices to add eithe

You can use mutable data structures in Haskell but we strive to avoid it except where strictly necessary. To find the "Haskell" version it suffices to add either "Haskell" or "persistent" to the search query for a data structure. Here's a priority queue library for Haskell, if you'd like an example: https://hackage.haskell.org/package/pqueue https://hackage.haskell.org/package/pqueue