#include<iostream>
#include<iomanip>
#include<string>
#include<fstream>
#include<cmath>
#include<vector>
#include<stack>
#include<cstdio>
#include<array>
#include<vector>
#include<map>
#include<queue>
using namespace std;
typedef struct treenode
{
int data;
struct treenode* left;
struct treenode* right;
}treenode, * treepoint;
treepoint Create_tree()
{
treepoint newpoint;
int data;
cin >> data;
if (data == -1)
{
return nullptr;
}
else
{
newpoint = new treenode{ data,NULL,NULL };
newpoint->left = Create_tree();
newpoint->right = Create_tree();
}
return newpoint;
}
void findAllPath(int num,treepoint tnode,int* a,int length)
{
if (tnode)
{
num = num - tnode->data;
a[length] = tnode->data;
if (num == 0)
{
for (int i = 0; i <= length; i++)
{
cout << a[i] << endl;
}
}
findAllPath(num, tnode->left, a, length + 1);
findAllPath(num, tnode->right, a, length + 1);
}
}
int main()
{
treepoint tnode1;
tnode1=Create_tree();
cout << "-------------------------" << endl;
int* a = new int[10]{0};
findAllPath(100, tnode1, a, 0);
//10 15 75 - 1 - 1 40 - 1 5 30 - 1 20 30 - 1 40 - 1 - 1 - 1
}
王道 220 求路径长度为X的树路径
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门，熙熙楼的掌柜王于贵愁眉苦脸地迎上来，“玉大人，你说我怎么就摊上这事。” “怎么了？”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着，像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上，一...
- 文/苍兰香墨 我猛地睁开眼，长吁一口气：“原来是场噩梦啊……” “哼！你这毒妇竟也来了？” 一声冷哼从身侧响起，我...
