LeetCode OJ - Sum Root to Leaf Numbers

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.

An example is the root-to-leaf path 1->2->3 which represents the number 123.

Find the total sum of all root-to-leaf numbers.

For example,

    1
   / \
  2   3

The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.

Return the sum = 12 + 13 = 25.

分析：二叉树DFS简单题

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
 //所有路径和
class Solution {
    int ret = 0;
public:
    int sumNumbers(TreeNode *root) {
        if(!root) return 0;
        DFS(root, 0);
        return ret;
    }
    
    void DFS(TreeNode *root, int total) {
        total = total * 10 + root->val;
        if(!root->left && !root->right) {
            ret += total;
        }
        
        if(root->left)
            DFS(root->left, total);
        if(root->right)
            DFS(root->right, total);
    }
};