Commit a518db0

authored

Update 0450.删除二叉搜索树中的节点.md

添加代码高亮

1 parent c88104b commit a518db0Copy full SHA for a518db0

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -42,15 +42,15 @@`
`42`	`42`
`43`	`43`	`代码如下:`
`44`	`44`
`45`		-```
	`45`	+```cpp
`46`	`46`	`TreeNode* deleteNode(TreeNode* root, int key)`
`47`	`47`	```
`48`	`48`
`49`	`49`	`* 确定终止条件`
`50`	`50`
`51`	`51`	`遇到空返回,其实这也说明没找到删除的节点,遍历到空节点直接返回了`
`52`	`52`
`53`		-```
	`53`	+```cpp
`54`	`54`	`if (root == nullptr) return root;`
`55`	`55`	```
`56`	`56`
`@@ -106,7 +106,7 @@ if (root->val == key) {`
`106`	`106`
`107`	`107`	`这里相当于把新的节点返回给上一层,上一层就要用 root->left 或者 root->right接住,代码如下:`
`108`	`108`
`109`		-```
	`109`	+```cpp
`110`	`110`	`if (root->val > key) root->left = deleteNode(root->left, key);`
`111`	`111`	`if (root->val < key) root->right = deleteNode(root->right, key);`
`112`	`112`	`return root;`

Comments

(0)