Commit0432e3a

committed

Added 199-binary-tree-right-side-view Javascript Solution

1 parent12fdcd4 commit0432e3aCopy full SHA for 0432e3a

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * function TreeNode(val, left, right) {`
	`4`	`+ * this.val = (val===undefined ? 0 : val)`
	`5`	`+ * this.left = (left===undefined ? null : left)`
	`6`	`+ * this.right = (right===undefined ? null : right)`
	`7`	`+ * }`
	`8`	`+ */`
	`9`	`+/**`
	`10`	`+ *@param {TreeNode} root`
	`11`	`+ *@return {number[]}`
	`12`	`+ */`
	`13`	`+varrightSideView=function(root){`
	`14`	`+letresult=[]`
	`15`	`+letqueue=[]`
	`16`	`+`
	`17`	`+if(root===null){`
	`18`	`+return[]`
	`19`	`+}`
	`20`	`+`
	`21`	`+queue.push(root)`
	`22`	`+`
	`23`	`+while(queue.length>0){`
	`24`	`+letlength=queue.length`
	`25`	`+for(leti=0;i<length;i++){`
	`26`	`+letnode=queue.shift()`
	`27`	`+if(i===length-1){`
	`28`	`+result.push(node.val)`
	`29`	`+}`
	`30`	`+if(node.left!==null)queue.push(node.left)`
	`31`	`+if(node.right!==null)queue.push(node.right)`
	`32`	`+}`
	`33`	`+}`
	`34`	`+returnresult`
	`35`	`+};`

Comments

(0)