Pseudo Code and conditions for deleting a Node in Binary Search Tree
问题 I'm trying to write a function to remove a node from a binary tree. I haven't coded the function yet, and I am trying to think about the different conditions I should consider for removing a node. I am guessing that the possible conditions are: The node has no children The node has one child The node has 2 children In each of these cases what would be the algorithm to perform a delete function? 回答1: This is something you would find in any standard textbook about algorithms, but let's suppose