每日一道算法题4——在二元树中找出和为某一值的所有路径

题目：输入一个整数和一棵二元树。从树的根节点开始往下访问一直到叶结点所经过的所有结点形成一条路径。打印出和与输入整数相等的所有路径。

例如输入整数22和如下二元树

则打印出两条路径：10，12和10，5，7

参考代码：

#include <iostream>
#include <vector>
using namespace std;

enum TREE_DIR
{
    LEFT_IN_PARRENT,
    RIGHT_IN_PARRENT
};

//定义二叉树
struct BinaryTreeNode
{
    int m_nValue; //value of node
    BinaryTreeNode *m_pLeft; //left child of node
    BinaryTreeNode *m_pRight; //right child of node
};
BinaryTreeNode *m_pRootNode = nullptr;
int sum = 0;
vector<int> path;
int pathIndex;
void addBinaryTreeNode(BinaryTreeNode *& pCurrentNode, int value);
void orderBinaryTreeNode(BinaryTreeNode *& pCurrentNode, int SumValue, vector<int> &path);

int main(int argc, char *argv[])
{

    addBinaryTreeNode(m_pRootNode, 10);
    addBinaryTreeNode(m_pRootNode, 5); 
    addBinaryTreeNode(m_pRootNode, 12);
    addBinaryTreeNode(m_pRootNode, 7);
    addBinaryTreeNode(m_pRootNode, 4);

    orderBinaryTreeNode(m_pRootNode, 22, path);
    getchar();
    return 0;
}
//构造二叉树
void addBinaryTreeNode(BinaryTreeNode *& pCurrentNode, int value)
{
    if (pCurrentNode == nullptr)
    {
        BinaryTreeNode *BinaryTempNode = new BinaryTreeNode;
        BinaryTempNode->m_nValue = value;
        BinaryTempNode->m_pLeft = nullptr;
        BinaryTempNode->m_pRight = nullptr;
        pCurrentNode = BinaryTempNode;
        return;
    }
    if (pCurrentNode->m_nValue > value)
    {
        addBinaryTreeNode(pCurrentNode->m_pLeft,value);
    }
    else if (pCurrentNode->m_nValue < value)
    {
        addBinaryTreeNode(pCurrentNode->m_pRight,value);
    }

} 

//遍历二叉树 先序遍历 DLR
void orderBinaryTreeNode(BinaryTreeNode *& pCurrentNode,int SumValue,vector<int> &path)
{
    if (nullptr == pCurrentNode) return;

    sum += pCurrentNode->m_nValue;//每遍历一个二叉树结点，将其存储值累加到sum
    path.push_back(pCurrentNode->m_nValue);//每遍历一个二叉树结点，将当前路径累加到path数组
    bool isLeaf = (nullptr == pCurrentNode->m_pLeft&&nullptr == pCurrentNode->m_pRight); //判断是否为叶子结点
    if (isLeaf && sum == SumValue)//判断当前所遍历路径是否满足题设
    {
        pathIndex++;//满足即将路径数+1
        cout << "路径"<<pathIndex<<": ";
        //满足条件
        for (auto i : path)//打印当前路径
        {
            cout << i << " ";
        }
        cout << endl;
    }

    orderBinaryTreeNode(pCurrentNode->m_pLeft, SumValue, path);//
    orderBinaryTreeNode(pCurrentNode->m_pRight, SumValue, path);

    path.pop_back();//不满足删除当前结点
    sum -= pCurrentNode->m_nValue;//删除当前累加结点值

}

思考，如何按照中序一层一层的往二叉树中添加元素？