1
2
3
4
5
6
7
8
9
10
11
12
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
export default sumOfLeftLeaves;
function sumOfLeftLeaves(root: TreeNode | null): number {    if (!root) return 0;    const sum = root.left && !root.left.left && !root.left.right        ? root.left.val        : 0;    return sum + sumOfLeftLeaves(root.left) + sumOfLeftLeaves(root.right);}