Commit 8f8580d

committed

Add js solution to leetcode problem: no.102

1 parent 316af28 commit 8f8580dCopy full SHA for 8f8580d

File tree

+75

-0

lines changed

solution/0100-0199
- 0101.Symmetric Tree
  - README.md
- 0102.Binary Tree Level Order Traversal
  - README_EN.md

+75

-0

lines changed

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -115,6 +115,43 @@ private:`
`115`	`115`	`}`
`116`	`116`	`};`
`117`	`117`	```
	`118`	`+### JavaScript`
	`119`	`+`
	`120`	+```js
	`121`	`+/**`
	`122`	`+ * Definition for a binary tree node.`
	`123`	`+ * function TreeNode(val) {`
	`124`	`+ * this.val = val;`
	`125`	`+ * this.left = this.right = null;`
	`126`	`+ * }`
	`127`	`+ */`
	`128`	`+/**`
	`129`	`+ * @param {TreeNode} root`
	`130`	`+ * @return {number[][]}`
	`131`	`+ */`
	`132`	`+var levelOrder = function (root) {`
	`133`	`+ let result = [];`
	`134`	`+ if (!root) return result;`
	`135`	`+`
	`136`	`+ let queue = [];`
	`137`	`+ queue.push(root);`
	`138`	`+ while (queue.length) {`
	`139`	`+ let size = queue.length;`
	`140`	`+ let levelItems = [];`
	`141`	`+ while (size--) {`
	`142`	`+ let node = queue.shift();`
	`143`	`+ levelItems.push(node.val);`
	`144`	`+ if (node.left) {`
	`145`	`+ queue.push(node.left);`
	`146`	`+ }`
	`147`	`+ if (node.right) {`
	`148`	`+ queue.push(node.right);`
	`149`	`+ }`
	`150`	`+ }`
	`151`	`+ result.push(levelItems);`
	`152`	`+ }`
	`153`	`+ return result;`
	`154`	`+};`
`118`	`155`
`119`	`156`	`### ...`
`120`	`157`

Lines changed: 38 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -140,6 +140,44 @@ public:`
`140`	`140`	`};`
`141`	`141`	```
`142`	`142`
	`143`	`+### JavaScript`
	`144`	`+`
	`145`	+```js
	`146`	`+/**`
	`147`	`+ * Definition for a binary tree node.`
	`148`	`+ * function TreeNode(val) {`
	`149`	`+ * this.val = val;`
	`150`	`+ * this.left = this.right = null;`
	`151`	`+ * }`
	`152`	`+ */`
	`153`	`+/**`
	`154`	`+ * @param {TreeNode} root`
	`155`	`+ * @return {number[][]}`
	`156`	`+ */`
	`157`	`+var levelOrder = function (root) {`
	`158`	`+ let result = [];`
	`159`	`+ if (!root) return result;`
	`160`	`+`
	`161`	`+ let queue = [];`
	`162`	`+ queue.push(root);`
	`163`	`+ while (queue.length) {`
	`164`	`+ let size = queue.length;`
	`165`	`+ let levelItems = [];`
	`166`	`+ while (size--) {`
	`167`	`+ let node = queue.shift();`
	`168`	`+ levelItems.push(node.val);`
	`169`	`+ if (node.left) {`
	`170`	`+ queue.push(node.left);`
	`171`	`+ }`
	`172`	`+ if (node.right) {`
	`173`	`+ queue.push(node.right);`
	`174`	`+ }`
	`175`	`+ }`
	`176`	`+ result.push(levelItems);`
	`177`	`+ }`
	`178`	`+ return result;`
	`179`	`+};`
	`180`	`+`
`143`	`181`	`### ...`
`144`	`182`
`145`	`183`	```

Comments

(0)