按先序打印二叉树叶子结点

Love The Way You Lie 2022-06-15 04:57 214阅读 0赞

/*按先序打印二叉树叶子结点*/
    #include<stdio.h>
    typedef struct btnode
    {
        char data;
        struct btnode *lchild,*rchild;      /*指向左右孩子的指针*/
    }BinTree;
    /*二叉树的创建*/
    BinTree * CreateTree(BinTree *T)
    {
        char ch;
        scanf("%c",&ch);
        if(ch=='#')
            return 0;
        else
        {
            T=(BinTree *)malloc(sizeof(BinTree));
            T->data=ch;
            T->lchild=CreateTree(T->lchild);    /*创建左子树*/
            T->rchild=CreateTree(T->rchild);    /*创建右子树*/
            return(T);
        }
    }
    /*先序遍历根指针为T的二叉树*/
    void Preorder(BinTree *T)
    {
        if(T)
        {
            printf("%c ",T->data);  /*访问根节点T*/
            Preorder(T->lchild);    /*先序遍历左子树*/
            Preorder(T->rchild);    /*先序遍历右子树*/
        }
    }
    /*打印叶子结点*/
    int leafnode(BinTree *T)
    {
        if(T!=NULL)
            {
                if((T->lchild==NULL) && (T->rchild==NULL))
                printf("%c ",T->data);
                leafnode(T->lchild);
                leafnode(T->rchild);
            }
    
    }
    main()
    {
        BinTree *b;
        printf("请按先序的方式输入二叉树的结点元素:\n");
        b=CreateTree(b);
        printf("前序输出:\n");
        Preorder(b);
        printf("\n");
        printf("按先序顺序打印叶子结点值:");
        leafnode(b);
    }