Commit ee0e80d

authored

0700 二叉搜索树部分代码更正

结果没问题,但逻辑不严谨

1 parent d2b05ae commit ee0e80dCopy full SHA for ee0e80d

File tree

-5

lines changed

-5

lines changed

Lines changed: 4 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -200,7 +200,7 @@ class Solution {`
`200`	`200`	`if (val < root.val) root = root.left;`
`201`	`201`	`else if (val > root.val) root = root.right;`
`202`	`202`	`else return root;`
`203`		`- return root;`
	`203`	`+ return null;`
`204`	`204`	`}`
`205`	`205`	`}`
`206`	`206`	```
`@@ -236,7 +236,7 @@ class Solution:`
`236`	`236`	`if val < root.val: root = root.left`
`237`	`237`	`elif val > root.val: root = root.right`
`238`	`238`	`else: return root`
`239`		`- return root`
	`239`	`+ return None`
`240`	`240`	```
`241`	`241`
`242`	`242`
`@@ -271,7 +271,7 @@ func searchBST(root TreeNode, val int) TreeNode {`
`271`	`271`	`break`
`272`	`272`	`}`
`273`	`273`	`}`
`274`		`- return root`
	`274`	`+ return nil`
`275`	`275`	`}`
`276`	`276`	```
`277`	`277`
`@@ -301,7 +301,6 @@ var searchBST = function (root, val) {`
`301`	`301`	`return searchBST(root.left, val);`
`302`	`302`	`if (root.val < val)`
`303`	`303`	`return searchBST(root.right, val);`
`304`		`- return null;`
`305`	`304`	`};`
`306`	`305`	```
`307`	`306`
`@@ -330,7 +329,7 @@ var searchBST = function (root, val) {`
`330`	`329`	`else`
`331`	`330`	`return root;`
`332`	`331`	`}`
`333`		`- return root;`
	`332`	`+ return null;`
`334`	`333`	`};`
`335`	`334`	```
`336`	`335`

Comments

(0)