How would one
execute an inorder traversal function for a binary search tree, that permits visit to delete the node visited.
How would one
execute an inorder traversal function for a binary search tree, that permits visit to delete the node visited.
Are you having problems with traversing the tree, or with the deletion?
Are you talking about a simultaneous in-order traversal with deletion of the nodes as they are visited?
"Owners of dogs will have noticed that, if you provide them with food and water and shelter and affection, they will think you are god. Whereas owners of cats are compelled to realize that, if you provide them with food and water and shelter and affection, they draw the conclusion that they are gods."
-Christopher Hitchens