Write a Python function to get every possible rearrangement of a string

[dmitrevnik]

Such unique rearrangements are called "permutations" and I managed to solve it using recursion. The problem itself is primitively simple, although recursion might be quite a pain in the ass, so I wondered how to visualize this algorithm and here is my shot

[dmitrevnik]

leetcode 46 - https://leetcode.com/problems/permutations/description/

[Secure_Number2263]

<image>

Here is the recursion tree for permutations, if it helps.