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

Merge pull request #909 from ccqstark/master

Browse Source 
Update 0669.修剪二叉搜索树.md
This commit is contained in:
程序员Carl
2021-11-19 15:14:31 +08:00
committed by GitHub
parent 6598443445 0a31eaa9d3
commit efa673e19f
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0669.修剪二叉搜索树.md
View File

@ -138,7 +138,7 @@ if (root->val < low) {
root->left = trimBST(root->left, low, high);
```
此时节点3的右孩子就变成了节点2，将节点0从二叉树中移除了。
此时节点3的左孩子就变成了节点2，将节点0从二叉树中移除了。
最后整体代码如下：