Commit 2d9e782

committed

update: 104

1 parent cd361bc commit 2d9e782Copy full SHA for 2d9e782

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,6 +55,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr`
`55`	`55`	`\|100\|[Same Tree](https://leetcode.com/problems/same-tree/) \| [JavaScript](./src/same-tree/res.js)\|Easy\|`
`56`	`56`	`\|101\|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) \| [JavaScript](./src/symmetric-tree/res.js)\|Easy\|`
`57`	`57`	`\|102\|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) \| [JavaScript](./src/binary-tree-level-order-traversal/res.js)\|Medium\|`
	`58`	`+\|104\|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) \| [JavaScript](./src/maximum-depth-of-binary-tree/res.js)\|Easy\|`
`58`	`59`	`\|107\|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/) \| [JavaScript](./src/binary-tree-level-order-traversal-ii/res.js)\|Easy\|`
`59`	`60`	`\|111\|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) \| [JavaScript](./src/minimum-depth-of-binary-tree/res.js)\|Easy\|`
`60`	`61`	`\|120\|[Triangle](https://leetcode.com/problems/triangle/) \| [JavaScript](./src/triangle/res.js)\|Medium\|`

Lines changed: 23 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,23 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * function TreeNode(val) {`
	`4`	`+ * this.val = val;`
	`5`	`+ * this.left = this.right = null;`
	`6`	`+ * }`
	`7`	`+ */`
	`8`	`+/**`
	`9`	`+ * @param {TreeNode} root`
	`10`	`+ * @return {number}`
	`11`	`+ */`
	`12`	`+var maxDepth = function(root) {`
	`13`	`+ if (!root) return 0;`
	`14`	`+`
	`15`	`+ const getTreeDepth = (element) => {`
	`16`	`+ if (!element) return 0;`
	`17`	`+ if (element.val !== undefined && !element.left && !element.right) return 1;`
	`18`	`+`
	`19`	`+ return 1 + Math.max(getTreeDepth(element.left), getTreeDepth(element.right))`
	`20`	`+ }`
	`21`	`+`
	`22`	`+ return 1 + Math.max(getTreeDepth(root.left), getTreeDepth(root.right));`
	`23`	`+};`

Lines changed: 1 addition & 0 deletions

Comments

(0)