《LeetCode力扣练习》代码随想录——二叉树（删除二叉搜索树中的节点---Java）

《LeetCode力扣练习》代码随想录——二叉树（删除二叉搜索树中的节点—Java）

---

---

刷题思路来源于 代码随想录

---

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) {
  
          return recursion(root, key);
  
      }
  
      private TreeNode recursion(TreeNode root, int key) {
  
          if (root == null) {
              return null;
          }
  
          if (root.val == key) {
  
              if (root.left == null && root.right == null) {
                  return null;
              }
  
              if (root.left != null && root.right == null) {
                  return root.left;
              }
  
              if (root.left == null && root.right != null) {
                  return root.right;
              }
  
              if (root.left != null && root.right != null) {
  
                  TreeNode temp = root.right;
  
                  while (temp.left != null) {
                      temp = temp.left;
                  }
  
                  temp.left = root.left;
  
                  return root.right;
  
              }
  
          }
  
          if (key < root.val) {
              root.left = recursion(root.left, key);
          }
  
          if (key > root.val) {
              root.right = recursion(root.right, key);
          }
  
          return root;
  
      }
  }
  

---