Commitf3208c8

zongyanqi

committed

add Easy_404_Sum_of_Left_Leaves

1 parent6ed7ce9 commitf3208c8Copy full SHA for f3208c8

File tree

+41

-0

lines changed

+41

-0

lines changed

Lines changed: 41 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,41 @@`
	`1`	`+/**`
	`2`	`+ * Find the sum of all left leaves in a given binary tree.`
	`3`	`+`
	`4`	`+ Example:`
	`5`	`+`
	`6`	`+ 3`
	`7`	`+ / \`
	`8`	`+ 9 20`
	`9`	`+ / \`
	`10`	`+ 15 7`
	`11`	`+`
	`12`	`+ There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.`
	`13`	`+ *`
	`14`	`+ */`
	`15`	`+`
	`16`	`+/**`
	`17`	`+ * Definition for a binary tree node.`
	`18`	`+ * function TreeNode(val) {`
	`19`	`+ * this.val = val;`
	`20`	`+ * this.left = this.right = null;`
	`21`	`+ * }`
	`22`	`+ */`
	`23`	`+`
	`24`	`+/**`
	`25`	`+ *@param {TreeNode} root`
	`26`	`+ *@return {number}`
	`27`	`+ */`
	`28`	`+varsumOfLeftLeaves=function(root){`
	`29`	`+returnfn(root,false);`
	`30`	`+};`
	`31`	`+`
	`32`	`+functionfn(node,isLeft){`
	`33`	`+if(!node)return0;`
	`34`	`+if(!node.left&&!node.right){`
	`35`	`+returnisLeft ?node.val :0;`
	`36`	`+}`
	`37`	`+`
	`38`	`+returnfn(node.left,true)+fn(node.right,false);`
	`39`	`+`
	`40`	`+}`
	`41`	`+`

Comments

(0)