Linux C

转载

mob604756f56fd6 2021-09-26 22:44:00

文章标签 二叉树结点 #include 层序遍历动态库 文章分类 代码人生

Linux C语言编程基础

二叉树实现

实现了2.12中二叉树，实现了二叉树的建立和层序输出，代码如下

#include <stdio.h>
#include<stdlib.h>
#define MAXLEN 256


/*二叉树结构建立*/
typedef struct BinTree
{
    int value;
    struct BinTree * Lchild;
    struct BinTree * Rchild;
}*BinTree , TreeNode;

/*存数队列*/
typedef struct Queue
{
    int tool[MAXLEN];
    int rear;
    int front;
}Queue;

void visit(BinTree root)
{
    printf("%d" , root -> value);
}

/*建立二叉树*/
BinTree creatBT(BinTree root)
{
    int a;
    printf("输入结点数据\n");
    scanf("%d",&a);

    if(a == 0)
    {
        root = NULL;
    }else{
        root = (BinTree)malloc(sizeof(TreeNode));
        root -> value = a ;

        if (!root)
        {
            printf("ERROR\n");
            return 0;
        }

        root -> Lchild = creatBT(root -> Lchild);
        root -> Rchild = creatBT(root -> Rchild);
    }
    return root;

}

/*层序遍历*/
void level_gothrough(BinTree root)
{
    BinTree queue[MAXLEN];
    int rear = 0 , front = 0;
    BinTree p = root;

    if(p != NULL )/*树不为空*/
    {
        queue[rear] = p;
        rear = rear+1;

        while(rear != front)
        {
            p = queue[front];
            visit(queue[front]);
            front = front+1;
            /*左子结点入队*/
            if (p -> Lchild != NULL)
            {
                queue[rear]=p->Lchild;
                rear++;
            }else
            {
                printf("#");
            }
            
            /*右子结点入队*/
             if (p -> Rchild != NULL)
            {
                queue[rear]=p->Rchild;
                rear++;
            }else
            {
                printf("#");
            }
        }
    }
}

/*main函数*/
int main()
{
    BinTree root = NULL;
    printf("输入0表示空\n");

    root = creatBT(root);

    printf("层序遍历结果：\n");
    level_gothrough(root);
    printf("\n");
}