https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/

Author: masx200

README.md

@@ -574,6 +574,8 @@ https://leetcode.cn/problems/basic-calculator/
 
 https://leetcode.cn/problems/evaluate-reverse-polish-notation/
 
+https://leetcode.cn/problems/sum-of-root-to-leaf-binary-numbers/
+
 #### 安装教程
 
 1. 安装`deno`

sum-of-root-to-leaf-binary-numbers/index.ts

@@ -0,0 +1,10 @@
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
+export default function sumRootToLeaf(root: TreeNode | null, sum = 0): number {
+    return !root
+        ? 0
+        : (!root.left) && (!root.right)
+        ? sum * 2 + root.val
+        : sumRootToLeaf(root.left, sum * 2 + root.val) +
+            sumRootToLeaf(root.right, sum * 2 + root.val);
+}