深度优先
深度优先搜索是很直观的做法。从根节点开始,遍历每个节点,如果遇到叶子节点,则将叶子节点对应的数字加到数字之和。如果当前节点不是叶子节点,则计算其子节点对应的数字,然后对子节点递归遍历。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
int sumNumbers(TreeNode* root) {
int sum = dfs(root, 0);
return sum;
}
int dfs(TreeNode* root, int presum) {
if (root == nullptr)
return 0;
int sum = presum * 10 + root->val;
if (root->left == nullptr && root->right == nullptr) {
return sum;
}
else {
return dfs(root->left, sum) + dfs(root->right, sum);
}
}
};