I know, maybe it's not very useful. But isn't it fascinating? Some information moved from the link node into the state of the program processing it. This halve

I know, maybe it's not very useful. But isn't it fascinating? Some information moved from the link node into the state of the program processing it. This halves the link redundancy of a doubly linked list. Suddenly a doubly linked list has the footprint of a singly linked list. How did that happen? :-) It taught me. Tricks like this make me a better programmer. Even if I won't use the principle involved in this exact way.