Nodes and more nodes

NoSQL data bases interesting topic; and now I must create a function that can delete any node in a binary tree and reset the parent, next and previous connections. The n's next previous to n's previous and so on a bit confusing when written as n.next.previous = n.previous & n.previous. next = n.next which is fine for a standard linkined or double linked list as you can delete the node afterwards and not think about it but a binary tree is a completely different story; and we're talking about shifting a whole set of branches and leafs

...