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

最新推荐文章于 2024-08-23 11:56:42 发布

hjhomw

最新推荐文章于 2024-08-23 11:56:42 发布

阅读量219

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/hejun_haitao/article/details/52874311

版权

剑指offer 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

代码：

struct BinaryTreeNode
{
    int m_value;
    BinaryTreeNode* m_pLeft;
    BinaryTreeNode* m_pRight;
};

void findPath(BinaryTreeNode* pRoot, int sum, vector<int>& path, int currentSum)
{
    currentSum += pRoot->m_value;
    path.push_back(pRoot->m_value);
    if (currentSum == sum && (pRoot->m_pLeft == nullptr) && (pRoot->m_pRight == nullptr))
    {
        cout << "A path is found: ";
        vector<int>::iterator iter = path.begin();
        for (; iter != path.end(); ++iter)
        {
            cout << *iter << " ";
        }
        cout << endl;
    }

    //若左子树不为空
    if (pRoot->m_pLeft != nullptr)
        findPath(pRoot->m_pLeft,sum,path,currentSum);

    //若右子树不为空
    if (pRoot->m_pRight != nullptr);
        findPath(pRoot->m_pRight, sum, path, currentSum);
}
//打印树的路径
void PrintPathOfBST(BinaryTreeNode* pRoot, int sum)
{
    if (!pRoot)
        return;
    vector<int> path;
    int currentSum = 0;
    findPath(pRoot, sum, path, currentSum);
}