Merge pull request #725 from ironartisan/master

添加0530.二叉搜索树的最小绝对值差.md迭代Java解法
This commit is contained in:
程序员Carl
2021-09-09 11:07:44 +08:00
committed by GitHub
4 changed files with 100 additions and 1 deletions

View File

@@ -293,6 +293,32 @@ class Solution {
}
}
```
```java
// 解法2
class Solution {
public TreeNode deleteNode(TreeNode root, int key) {
if (root == null) return root;
if (root.val == key) {
if (root.left == null) {
return root.right;
} else if (root.right == null) {
return root.left;
} else {
TreeNode cur = root.right;
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);
if (root.val < key) root.right = deleteNode(root.right, key);
return root;
}
}
```
## Python