Introduction - If you have any usage issues, please Google them yourself
In the binary search tree delete a node with two children, you can use the following three ways: (1) with a left subtree TL key code with the largest node X replacement, and then recursively delete X. (2) alternately with the left subtree TL key code with the largest node, and the right subtree TR on the key code with minimal replacement of nodes, then recursively delete the appropriate node. (3) with a left subtree TL key code with the largest node or with the right subtree TR key code that has the smallest node replacement, recursively delete the appropriate node. Can randomly select one of the options. Try to delete programming to achieve these three methods, with examples which the balance of the easiest ways.