代码随想录——450. 删除二叉搜索树中的节点

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public TreeNode deleteNode(TreeNode root, int key) {
        root = delete(root,key);
        return root;
    }

    public TreeNode delete(TreeNode root, int val){
        if(root == null) return null;

        if(root.val > val){
            root.left = delete(root.left,val);
        }else if(root.val < val){
            root.right = delete(root.right,val);
        }else{
            if(root.left == null)   return root.right;
            if(root.right == null)  return root.left;
            TreeNode cur = root.right;
            while(cur.left != null){
                cur = cur.left;
            }
            cur.left = root.left;
            TreeNode tmp = root;
            root = root.right;
            return root;
        }
        return root;
    }
}