剑指offer34 二叉树中和为某一值的路径

输入一棵二叉树和一个整数，打印出二叉树中节点值的和为输入整数的所有路径。从树的根节点开始往下一直到叶节点所经过的节点形成一条路径。

此题的解法和思路和leetcode 113 路径之和是相同的：
移步：https://blog.csdn.net/CLZHIT/article/details/103935351

/**
 * 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:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        vector<vector<int>> result;
        vector<int> path;
        int path_value = 0;
        preOrderTraveral(root, path_value, sum, path, result);
        return result;
    }

    void preOrderTraveral(TreeNode* root, int path_value, int sum, vector<int>& path, vector<vector<int>>& result)
    {
        if(root == nullptr)
        {
            return;
        }
        path_value += root->val;
        path.push_back(root->val);
        if(!root->left && !root->right && path_value == sum)
        {
            result.push_back(path);
        }
        preOrderTraveral(root->left, path_value, sum, path, result);
        preOrderTraveral(root->right, path_value, sum, path, result);
        path_value -= root->val;
        path.pop_back();
    }
};