Commitd5e128e

NevS

authored

添加 0701.二叉搜索树中的插入操作 go版（迭代法）

1 parent0f38eb9 commitd5e128eCopy full SHA for d5e128e

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -271,6 +271,9 @@ class Solution:`
`271`	`271`
`272`	`272`
`273`	`273`	`Go：`
	`274`	`+`
	`275`	`+递归法`
	`276`	`+`
`274`	`277`	```Go
`275`	`278`	`funcinsertIntoBST(root TreeNode,valint) TreeNode {`
`276`	`279`	`if root ==nil {`
`@@ -285,6 +288,31 @@ func insertIntoBST(root TreeNode, val int) TreeNode {`
`285`	`288`	`return root`
`286`	`289`	`}`
`287`	`290`	```
	`291`	`+迭代法`
	`292`	+```go
	`293`	`+funcinsertIntoBST(root TreeNode,valint) TreeNode {`
	`294`	`+if root ==nil {`
	`295`	`+return &TreeNode{Val:val}`
	`296`	`+ }`
	`297`	`+node:= root`
	`298`	`+varpnode *TreeNode`
	`299`	`+for node !=nil {`
	`300`	`+if val > node.Val {`
	`301`	`+ pnode = node`
	`302`	`+ node = node.Right`
	`303`	`+ }else {`
	`304`	`+ pnode = node`
	`305`	`+ node = node.Left`
	`306`	`+ }`
	`307`	`+ }`
	`308`	`+if val > pnode.Val {`
	`309`	`+ pnode.Right = &TreeNode{Val: val}`
	`310`	`+ }else {`
	`311`	`+ pnode.Left = &TreeNode{Val: val}`
	`312`	`+ }`
	`313`	`+return root`
	`314`	`+}`
	`315`	+```
`288`	`316`
`289`	`317`	`JavaScript版本`
`290`	`318`

Comments

(0)