在二元树中找出和为某一值的所有路径

main.c

/**
4.在二元树中找出和为某一值的所有路径
题目：输入一个整数和一棵二元树。
从树的根结点开始往下访问一直到叶结点所经过的所有结点形成一条路径。
打印出和与输入整数相等的所有路径。
例如 输入整数22和如下二元树
10
/ /
5 12
/ /
4 7
则打印出两条路径：10, 12和10, 5, 7。
二元树节点的数据结构定义为：
struct BinaryTreeNode // a node in the binary tree
{
int m_nValue; // value of node
BinaryTreeNode *m_pLeft; // left child of node
BinaryTreeNode *m_pRight; // right child of node
};
*/
#include <stdio.h>
#include <stdlib.h>
#define NUM_FIXED 5
#include"stack.h"
typedef struct BinaryTreeNode // a node in the binary tree
{
int m_nValue; // value of node
struct BinaryTreeNode *m_pLeft; // left child of node
struct BinaryTreeNode *m_pRight; // right child of node
}BTreeNode,*BTree;

Stack S;//利用栈存储遍历路径上的节点

void CreateBTree(BTree *T)
{
    int val;
    char a[12];

    scanf("%s",a);
    if(a[0]=='#')
        *T=NULL;
    else
    {
        *T=(BTree)malloc(sizeof(BTreeNode));
        val=atoi(a);
        (*T)->m_nValue=val;

  //      printf("%d ",(*T)->m_nValue);

        CreateBTree(&((*T)->m_pLeft));
        CreateBTree(&((*T)->m_pRight));
    }
}

void TraveTree(BTree T)
{
    if(T)
    {
        printf("%d  ",T->m_nValue);
        TraveTree(T->m_pLeft);
        TraveTree(T->m_pRight);
    }
}

void TreeSearch(BTree T,int preSum,int num)
{
    int curSum;

    if(T==NULL)
        return;

    curSum=preSum+T->m_nValue;

 //   printf("%d ",curSum);

    if(curSum<num || curSum>num)//注意有可能有负数,不一定越往下求和值越大
    {
            Push(&S,T->m_nValue);
            TreeSearch(T->m_pLeft,curSum,num);
            TreeSearch(T->m_pRight,curSum,num);
            Pop(&S);
    }
    else if(curSum==num)
    {
        Push(&S,T->m_nValue);
        Print(&S);
        Pop(&S);
    }
}

int main()
{
    BTree root;

    printf("输入二叉树结点值，并以井号键表示空\n");//若构造一个例子给出的二叉树则输入：10 5 4 # # 7 # # 12 # #
    CreateBTree(&root);
 //   TraveTree(root);
    InitStack(&S);
    TreeSearch(root,0,NUM_FIXED);

    return 0;
}

stack.h

<pre name="code" class="cpp">#ifndef STACK_H_INCLUDED
#define STACK_H_INCLUDED
#define N 50
typedef struct
{
    int s[N];
    int top;
    int size;
}Stack;

void InitStack(Stack *S)
{
    S->top=0;
    S->size=0;
}
int StackEmpty(Stack *S)
{
    if(S->size==0)
        return 1;
    else
        return 0;
}

int StackFull(Stack *S)
{
    if(S->size==N)
        return 1;
    else
        return 0;
}

void Push(Stack *S,int n)
{
    if(StackFull(S))
        exit(EXIT_FAILURE);
    S->s[(S->top)++]=n;
    (S->size)++;
}

void Pop(Stack *S)
{
    if(StackEmpty(S))
        exit(EXIT_FAILURE);
    (S->top)--;
    (S->size)--;
}

void Print(Stack *S)
{
    int i;

    i=0;
    while(i<S->top)
    {
        printf("%d ",S->s[i]);
        i++;
    }
    putchar('\n');
}


#endif // STACK_H_INCLUDED