@nyanide oh easy then. You can either walk the list iteratively and keep a temp pointer so that you keep track of the next available node, or you can do it recursively and depth-first destroy. The iterative version is more space efficient but the recursive version gets your dick really hard so its basically neck and neck (unless tail call recursion is implemented (it is (in which case they are equivalent)))