/*******************************************************************
Copyright(c) 2016, Tyrone Li
All rights reserved.
*******************************************************************/
// 作者:TyroneLi
//
/*
Q:
二叉树中和为某一个值得路径。
输入一颗二叉树和一个整数,打印出二叉树中结点值的和为输入的某一整数的所有路径。
树的路径定义:
从树的根结点开始往下一直到叶子结点的所形成的路线叫路径。
S:
由于需要从根节点遍历直至叶子节点然后求满足的路径,因此需要通过回溯的方法去求出满足的路径。
考虑需要先遍历根节点,考虑采用前序遍历的方法,当用前序遍历的方法访问到某个根节点的时候,
把该节点加入到路径中,同时累加该节点的值。如果该节点是叶子节点而且路径中的结点值的和刚好
是等于该整数,那么当前该路径满足条件;如果不是叶子节点则继续访问它的子节点,当前节点访问
结束之后,递归函数将会自动回到它的父节点,在函数推出之前需要先减去该节点的值同时将该节点
从路径上删除。
*/
#include "../utils/BinaryTree.h"
#include <iostream>
#include <vector>
#include <cstdio>
#include <cstdlib>
void findMethod(BinaryTreeNode*pRoot, int g_sum, std::vector<int>&paths, int cur_sum)
{
cur_sum += pRoot->m_nValue;
paths.push_back(pRoot->m_nValue);
bool is_leafNode = (pRoot->m_pLeft == nullptr && pRoot->m_pRight == nullptr);
if(is_leafNode && (cur_sum == g_sum))
{
std::cout << "FInd one path." << std::endl;
std::vector<int>::iterator iter = paths.begin();
for(; iter != paths.end(); ++iter)
std::cout << (*iter) << " ";
std::cout << std::endl;
}
if(pRoot->m_pLeft != nullptr)
findMethod(pRoot->m_pLeft, g_sum, paths, cur_sum);
if(pRoot->m_pRight != nullptr)
findMethod(pRoot->m_pRight, g_sum, paths, cur_sum);
cur_sum -= pRoot->m_nValue;
paths.pop_back();
}
void findPaths(BinaryTreeNode*pRoot, int g_sum)
{
if(pRoot == nullptr)
return;
int cur_sum = 0;
std::vector<int> paths;
findMethod(pRoot, g_sum, paths, cur_sum);
}
void test_1()
{
std::cout << "Test 1" << std::endl;
BinaryTreeNode*pRoot_1 = createBinaryTreeNode(10);
BinaryTreeNode*pRoot_2 = createBinaryTreeNode(5);
BinaryTreeNode*pRoot_3 = createBinaryTreeNode(12);
BinaryTreeNode*pRoot_4 = createBinaryTreeNode(4);
BinaryTreeNode*pRoot_5 = createBinaryTreeNode(7);
connectTreeNodes(pRoot_1, pRoot_2, pRoot_3);
connectTreeNodes(pRoot_2, pRoot_4, pRoot_5);
printTreePreOrder(pRoot_1);
std::cout << std::endl;
findPaths(pRoot_1, 22);
std::cout << std::endl;
}
void test_2()
{
std::cout << "Test 2" << std::endl;
BinaryTreeNode*pRoot_1 = createBinaryTreeNode(10);
BinaryTreeNode*pRoot_2 = createBinaryTreeNode(5);
BinaryTreeNode*pRoot_3 = createBinaryTreeNode(12);
BinaryTreeNode*pRoot_4 = createBinaryTreeNode(4);
BinaryTreeNode*pRoot_5 = createBinaryTreeNode(7);
connectTreeNodes(pRoot_1, pRoot_2, pRoot_3);
connectTreeNodes(pRoot_2, pRoot_4, pRoot_5);
printTreePreOrder(pRoot_1);
std::cout << std::endl;
findPaths(pRoot_1, 32);
std::cout << std::endl;
}
void test_findPaths()
{
test_1();
test_2();
}
int main(int argc, char**argv)
{
test_findPaths();
return 0;
}
剑指offer-二叉树中值等于某个数的路径
最新推荐文章于 2021-07-07 18:04:25 发布