algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-05 00:25:22 +08:00
Code Issues Packages Projects Releases Wiki Activity
Files
LeetCode-Go/leetcode/0404.Sum-of-Left-Leaves/README.md
YDZ 4e11f4028a 规范格式
2020-08-07 17:06:53 +08:00

467 B
Executable File
Raw Permalink Blame History

404. Sum of Left Leaves

题目

Find the sum of all left leaves in a given binary tree.

Example:

    3
   / \
  9  20
    /  \
   15   7

There are two left leaves in the binary tree, with values 9 and 15 respectively. Return 24.

题目大意

计算给定二叉树的所有左叶子之和。

解题思路

  • 这一题是微软的面试题。递归求解即可