We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent ca29ff7 commit 893d145Copy full SHA for 893d145
maximum-depth-of-binary-tree/hozzijeong.js
@@ -0,0 +1,34 @@
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
+var maxDepth = function(root) {
14
+ if(!root) return 0
15
+
16
+ const dfs = (node, level) =>{
17
+ if(!node) return level;
18
19
+ let left = level;
20
+ let right = level
21
22
+ if(node.left){
23
+ left = dfs(node.left, level+1)
24
+ }
25
26
+ if(node.right){
27
+ right = dfs(node.right, level+1)
28
29
30
+ return Math.max(left,right);
31
32
33
+ return dfs(root,1)
34
+};
0 commit comments