Commit a9aad79

authored

feat: add ts solution to lc problem: No.701 (doocs#2833)

1 parent 4cb7256 commit a9aad79Copy full SHA for a9aad79

File tree

+76

-0

lines changed

+76

-0

lines changed

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -177,6 +177,33 @@ func insertIntoBST(root TreeNode, val int) TreeNode {`
`177`	`177`	`}`
`178`	`178`	```
`179`	`179`
	`180`	`+#### TypeScript`
	`181`	`+`
	`182`	+```ts
	`183`	`+/**`
	`184`	`+ * Definition for a binary tree node.`
	`185`	`+ * class TreeNode {`
	`186`	`+ * val: number`
	`187`	`+ * left: TreeNode \| null`
	`188`	`+ * right: TreeNode \| null`
	`189`	`+ * constructor(val?: number, left?: TreeNode \| null, right?: TreeNode \| null) {`
	`190`	`+ * this.val = (val===undefined ? 0 : val)`
	`191`	`+ * this.left = (left===undefined ? null : left)`
	`192`	`+ * this.right = (right===undefined ? null : right)`
	`193`	`+ * }`
	`194`	`+ * }`
	`195`	`+ */`
	`196`	`+`
	`197`	`+function insertIntoBST(root: TreeNode \| null, val: number): TreeNode \| null {`
	`198`	`+ if (!root) return new TreeNode(val);`
	`199`	`+`
	`200`	`+ if (val < root.val) root.left = insertIntoBST(root.left, val);`
	`201`	`+ else root.right = insertIntoBST(root.right, val);`
	`202`	`+`
	`203`	`+ return root;`
	`204`	`+}`
	`205`	+```
	`206`	`+`
`180`	`207`	`<!-- tabs:end -->`
`181`	`208`
`182`	`209`	`<!-- solution:end -->`

Lines changed: 27 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -175,6 +175,33 @@ func insertIntoBST(root TreeNode, val int) TreeNode {`
`175`	`175`	`}`
`176`	`176`	```
`177`	`177`
	`178`	`+#### TypeScript`
	`179`	`+`
	`180`	+```ts
	`181`	`+/**`
	`182`	`+ * Definition for a binary tree node.`
	`183`	`+ * class TreeNode {`
	`184`	`+ * val: number`
	`185`	`+ * left: TreeNode \| null`
	`186`	`+ * right: TreeNode \| null`
	`187`	`+ * constructor(val?: number, left?: TreeNode \| null, right?: TreeNode \| null) {`
	`188`	`+ * this.val = (val===undefined ? 0 : val)`
	`189`	`+ * this.left = (left===undefined ? null : left)`
	`190`	`+ * this.right = (right===undefined ? null : right)`
	`191`	`+ * }`
	`192`	`+ * }`
	`193`	`+ */`
	`194`	`+`
	`195`	`+function insertIntoBST(root: TreeNode \| null, val: number): TreeNode \| null {`
	`196`	`+ if (!root) return new TreeNode(val);`
	`197`	`+`
	`198`	`+ if (val < root.val) root.left = insertIntoBST(root.left, val);`
	`199`	`+ else root.right = insertIntoBST(root.right, val);`
	`200`	`+`
	`201`	`+ return root;`
	`202`	`+}`
	`203`	+```
	`204`	`+`
`178`	`205`	`<!-- tabs:end -->`
`179`	`206`
`180`	`207`	`<!-- solution:end -->`

Lines changed: 22 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,22 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * class TreeNode {`
	`4`	`+ * val: number`
	`5`	`+ * left: TreeNode \| null`
	`6`	`+ * right: TreeNode \| null`
	`7`	`+ * constructor(val?: number, left?: TreeNode \| null, right?: TreeNode \| null) {`
	`8`	`+ * this.val = (val===undefined ? 0 : val)`
	`9`	`+ * this.left = (left===undefined ? null : left)`
	`10`	`+ * this.right = (right===undefined ? null : right)`
	`11`	`+ * }`
	`12`	`+ * }`
	`13`	`+ */`
	`14`	`+`
	`15`	`+function insertIntoBST(root: TreeNode \| null, val: number): TreeNode \| null {`
	`16`	`+ if (!root) return new TreeNode(val);`
	`17`	`+`
	`18`	`+ if (val < root.val) root.left = insertIntoBST(root.left, val);`
	`19`	`+ else root.right = insertIntoBST(root.right, val);`
	`20`	`+`
	`21`	`+ return root;`
	`22`	`+}`

Comments

(0)