A lot of people think that functional programming is mostly about avoiding mutation at all costs. Even though persistent data structures are great and there is definitely some truth to it, this view just doesn't really hold up in reality. Many data structures fundamentally require some form of mutation (e.g. union find) and even something simple like a persistent sequential data structure that allows both fast appends and fast random access is orders of magnitude more complicated and still slowe...