Commit826927e

committed

提供JavaScript版本的《二叉搜索树中的插入操作》

1 parentbf7597f commit826927eCopy full SHA for 826927e

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -286,6 +286,39 @@ func insertIntoBST(root TreeNode, val int) TreeNode {`
`286`	`286`	`}`
`287`	`287`	```
`288`	`288`
	`289`	`+JavaScript版本`
	`290`	`+`
	`291`	`+> 有返回值的递归写法`
	`292`	`+`
	`293`	+```javascript
	`294`	`+/**`
	`295`	`+ * Definition for a binary tree node.`
	`296`	`+ * function TreeNode(val, left, right) {`
	`297`	`+ * this.val = (val===undefined ? 0 : val)`
	`298`	`+ * this.left = (left===undefined ? null : left)`
	`299`	`+ * this.right = (right===undefined ? null : right)`
	`300`	`+ * }`
	`301`	`+*/`
	`302`	`+/**`
	`303`	`+ * @param {TreeNode} root`
	`304`	`+ * @param {number} val`
	`305`	`+ * @return {TreeNode}`
	`306`	`+*/`
	`307`	`+var insertIntoBST = function (root, val) {`
	`308`	`+const setInOrder = (root, val) => {`
	`309`	`+ if (root === null) {`
	`310`	`+ let node = new TreeNode(val);`
	`311`	`+ return node;`
	`312`	`+ }`
	`313`	`+ if (root.val > val)`
	`314`	`+ root.left = setInOrder(root.left, val);`
	`315`	`+ else if (root.val < val)`
	`316`	`+ root.right = setInOrder(root.right, val);`
	`317`	`+ return root;`
	`318`	`+}`
	`319`	`+return setInOrder(root, val);`
	`320`	`+};`
	`321`	+```
`289`	`322`
`290`	`323`
`291`	`324`

Comments

(0)