大侠帮我看看这段程序# JobHunting - 待字闺中
c*g
1 楼
给一定一个binary tree, 给定一个值,然后求出从root开始的和为target value的
path
我这段程序为什么不对呢?
void
Tree::findPath(Node* head, int sum, int path[], int level){
if(head == NULL) return;
if(sum == 0) {
for(int i = 0 ; i < level; i++)
std::cout< } else {
path[level] = head->value;
findPath(head->left, sum - head->value, path, level+1);
findPath(head->right, sum - head->value, path, level+1);
}
}
path
我这段程序为什么不对呢?
void
Tree::findPath(Node* head, int sum, int path[], int level){
if(head == NULL) return;
if(sum == 0) {
for(int i = 0 ; i < level; i++)
std::cout<
path[level] = head->value;
findPath(head->left, sum - head->value, path, level+1);
findPath(head->right, sum - head->value, path, level+1);
}
}