We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d1327e1 commit 1637f03Copy full SHA for 1637f03
1161-maximum-level-sum-of-a-binary-tree.js
@@ -36,3 +36,33 @@ const maxLevelSum = function(root) {
36
37
return res
38
}
39
+
40
+// DFS
41
42
+const maxLevelSum = function(root) {
43
+ let result = {};
44
+ let recursion = function(root, level) {
45
+ if (result[level] !== undefined) {
46
+ result[level] += root.val;
47
+ } else {
48
+ result[level] = root.val;
49
+ }
50
+ if (root.left !== null) {
51
+ recursion(root.left, level + 1);
52
53
+ if (root.right !== null) {
54
+ recursion(root.right, level + 1);
55
56
+ };
57
+ recursion(root, 1);
58
+ let resultkey = 1;
59
+ let max = Number.MIN_VALUE;
60
+ for (let key of Object.keys(result)) {
61
+ if (result[key] > max) {
62
+ max = result[key];
63
+ resultkey = key;
64
65
66
+ return Number(resultkey);
67
+};
68
0 commit comments