【Leetcode】404. Sum of Left Leaves

404. Sum of Left Leaves

【题目】中文版英文版

 /**

  * Definition for a binary tree node.

  * struct TreeNode {

  *     int val;

  *     TreeNode *left;

  *     TreeNode *right;

  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}

  * };

  */

 class Solution

 {

 public:

     int sumOfLeftLeaves(TreeNode* root)

     {

         int res = ;

         solute(root, res, false);

         return res;

     }

     void solute(TreeNode *root, int &sum, bool flag)

     {

         if(root == nullptr)

             return;

         if(!root->left && !root->right)

         {

             if(flag == true)

                 sum += root->val;

             return;

         }

         solute(root->left, sum, true);

         solute(root->right, sum, false);

         return;

     }

 };

【Leetcode】404. Sum of Left Leaves的相关教程结束。

《【Leetcode】404. Sum of Left Leaves.doc》

下载本文的Word格式文档，以方便收藏与打印。

相关推荐

【LeetCode OJ】Recover Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/recover-binary-search-tree/ We know that the inorder traversal of a binary search tree should be a sorted array. Therefore, we can compare each node w...
2023-08-01编程代码leetcode,oj,recover
【LeetCode OJ】Validate Binary Search Tree

Problem Link: https://oj.leetcode.com/problems/validate-binary-search-tree/ We inorder-traverse the tree, and for each node we check if current_node.val > prev_node.val. The code is as follows. ...
2023-08-01编程代码leetcode,oj,validate
【LeetCode OJ】Binary Tree Level Order Traversal

Problem Link: https://oj.leetcode.com/problems/binary-tree-level-order-traversal/ Traverse the tree level by level using BFS method. # Definition for a binary tree node # class TreeNode: # def...
2023-08-01编程代码Binary,leetcode,oj
【LeetCode OJ】Symmetric Tree

Problem Link: https://oj.leetcode.com/problems/symmetric-tree/ To solve the problem, we can traverse the tree level by level. For each level, we construct an array of values of the length 2^depth, ...
2023-08-01编程代码leetcode,oj,tree
【LeetCode OJ】Same Tree

Problem Link: https://oj.leetcode.com/problems/same-tree/ The following recursive version is accepted but the iterative one is not accepted... # Definition for a binary tree node # class TreeNode:...
2023-08-01编程代码leetcode,oj,tree
Leetcode 242.有效的字母异位词(Python3)

题目：给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s =...
2023-08-01编程代码leetcode,字母,异位
Leetcode 242.有效的字母异位词 By Python

给定两个字符串 s 和 t ，编写一个函数来判断 t 是否是 s 的一个字母异位词。示例 1: 输入: s = "anagram", t = "nagaram" 输出: true 示例 2: 输入: s = "rat", t = "car&...
2023-08-01编程代码leetcode,字母,异位
2021-05-27：定义何为step sum？比如680，680+68+6=754，680的step sum叫754。

2021-05-27：定义何为step sum？比如680，680+68+6=754，680的step sum叫754。给定一个整数num，判断它是不是某个数的step sum？福大大答案2021-05-27：方法一：自然智慧即可。二分法。在0到num之间找中点，...
2023-07-29编程代码SUM,何为,定义