mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 16:54:50 +08:00
添加0450.删除二叉搜索树中的节点.mdJava解法
This commit is contained in:
@ -286,11 +286,9 @@ class Solution {
|
||||
if (root.val == key) {
|
||||
if (root.left == null) {
|
||||
return root.right;
|
||||
}
|
||||
else if (root.right == null) {
|
||||
} else if (root.right == null) {
|
||||
return root.left;
|
||||
}
|
||||
else{
|
||||
} else {
|
||||
TreeNode cur = root.right;
|
||||
while (cur.left != null) {
|
||||
cur = cur.left;
|
||||
@ -304,6 +302,7 @@ class Solution {
|
||||
if (root.val < key) root.right = deleteNode(root.right, key);
|
||||
return root;
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
## Python
|
||||
|
Reference in New Issue
Block a user