一、思路
递归出口:
- 当前节点为空,返回null
- 当前节点的值等于要删除节点的值:
- 当前节点没有左子树
- 当前节点没有右子树
- 当前节点既有左子树又有右子树
二、代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode deleteNode(TreeNode root, int key) {
//递归出口1
if(root == null){
return root;
}
//出口2
if(root.val == key){
if(root.left == null){
return root.right;
}else if(root.right == null){
return root.left;
}else{//root.left != null && root.right != null
TreeNode node = root.right;
while(node.left != null){
node = node.left;
}
node.left = root.left;
return root.right;
}
}
//递归过程
if(root.val < key){
root.right = deleteNode(root.right, key);
}else{
root.left = deleteNode(root.left, key);
}
return root;
}
}