algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

添加0450.删除二叉搜索树中的节点.mdJava解法

Browse Source
This commit is contained in:
ironartisan
2021-09-07 21:48:13 +08:00
parent d52cb2aa49
commit 6a6d6f993a
1 changed files with 19 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
problems/0450.删除二叉搜索树中的节点.md
View File

@ -281,29 +281,28 @@ class Solution {
```java ```java
// 解法2 // 解法2
class Solution { class Solution {
public TreeNode deleteNode(TreeNode root, int key) { public TreeNode deleteNode(TreeNode root, int key) {
if (root == null) return root; if (root == null) return root;
if (root.val == key) { if (root.val == key) {
if (root.left == null) { if (root.left == null) {
return root.right; return root.right;
} } else if (root.right == null) {
else if (root.right == null) { return root.left;
return root.left; } else {
} TreeNode cur = root.right;
else{ while (cur.left != null) {
TreeNode cur = root.right; cur = cur.left;
while (cur.left != null) {
cur = cur.left;
}
cur.left = root.left;
root = root.right;
return root;
}
} }
if (root.val > key) root.left = deleteNode(root.left, key); cur.left = root.left;
if (root.val < key) root.right = deleteNode(root.right, key); root = root.right;
return root; return root;
}
} }
if (root.val > key) root.left = deleteNode(root.left, key);
if (root.val < key) root.right = deleteNode(root.right, key);
return root;
}
}
``` ```
## Python ## Python