Create 1302-deepest-leaves-sum.js

Author: everthis

1302-deepest-leaves-sum.js

@@ -0,0 +1,29 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+const deepestLeavesSum = function(root) {
+  let res= 0
+  let q = [root]
+  while(q.length) {
+    const size = q.length
+    const tmp = []
+    res = 0
+    for(let i = 0; i < size; i++) {
+      res += q[i].val
+      if(q[i].left) tmp.push(q[i].left)
+      if(q[i].right) tmp.push(q[i].right)
+    }
+    
+    q = tmp
+  }
+  return res
+};