Efficient delete of a tree data structure?

EDIT: Missed the bit about back-pointers to the parent node. That means we don't need to maintain a path history to backtrack, and we can do away with the stack.

I would try something much simpler, and let the recursive destructors do their duty.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.