How would one
execute an inorder traversal function for a binary search tree, that permits visit to delete the node visited.
Printable View
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?