How would one
execute an inorder traversal function for a binary search tree, that permits visit to delete the node visited.