二叉树的编程与实现

实验目的：掌握指针变量、动态变量的含义，掌握二叉树的结构特征，以及各种存储结构的特点及适用范围，掌握指针类型描述、访问和处理二叉树的运算；

实验原理：参照课本 p.95-107， Figure4.13-4.25；

实验内容：已知以二叉树表作为存储结构，写出按层次顺序遍历二叉树的算法

算法思想：本算法采用一个队列 q，先将二叉树根节点入队列，然后退队列，输出该节点，若它有左子树，便将左子树根节点入队列；若有右子树，便将右子树根节点入队列，直到队列空为止。因为队列的特点是先进先出，从而达到按层次顺序遍历二叉树的目的。

实验要求：
1) 实现二叉树表的层次遍历算法，并给出应用。

---

---

相关代码
fatal.h

/*
 *  预定义错误帮助函数
 */
#include <stdio.h>  
#include <stdlib.h>  

#define Error( Str )        FatalError( Str )  
#define FatalError( Str )   fprintf( stderr, "%s\n", Str ), exit( 1 )  

tree.h

/*
 *树相关函数及结构声明
 */
#ifndef _Tree_H  

typedef char ElementType;

struct TreeNode;
typedef struct TreeNode *Position;
typedef struct TreeNode *SearchTree;

SearchTree MakeEmpty(SearchTree T);
Position Find(ElementType X, SearchTree T);
Position FindMin(SearchTree T);
Position FindMax(SearchTree T);
SearchTree Insert(ElementType X, SearchTree T);
SearchTree Delete(ElementType X, SearchTree T);
ElementType Retrieve(Position P);

void PrintElement(SearchTree T);
void PreOrder(SearchTree T);
void InOrder(SearchTree T);
void PostOrder(SearchTree T);

#endif /* Tree_H */

tree.c

/*
 *相关函数的实现
 */
#include "fatal.h"  
#include "tree.h"  

struct TreeNode
{
    ElementType Element;
    SearchTree Left;
    SearchTree Right;
};

SearchTree
MakeEmpty(SearchTree T)
{
    if (T != NULL)
    {
        MakeEmpty(T->Left);
        MakeEmpty(T->Right);
        free(T);
    }
    return NULL;
}

Position
Find(ElementType X, SearchTree T)
{
    if (T == NULL)
        return NULL;
    if (X < T->Element)
        return Find(X, T->Left);
    else
        if (X > T->Element)
            return Find(X, T->Right);
        else
            return T;
}

/* 对二叉查找树的FindMin的递归实现 */
Position
FindMin(SearchTree T)
{
    if (T == NULL)
        return NULL;
    else
        if (T->Left == NULL)
            return T;
        else
            return FindMin(T->Left);
}

/* 对二叉查找树的FindMax的非递归实现 */
Position
FindMax(SearchTree T)
{
    if (T != NULL)
        while (T->Right != NULL)
            T = T->Right;

    return T;
}

SearchTree
Insert(ElementType X, SearchTree T)
{
    if (T == NULL)
    {
        /* Create and return a one-node tree */
        T = malloc(sizeof(struct TreeNode));
        if (T == NULL)
            FatalError("Out of space!!!");
        else
        {
            T->Element = X;
            T->Left = T->Right = NULL;
        }
    }
    else
        if (X < T->Element)
            T->Left = Insert(X, T->Left);
        else
            if (X > T->Element)
                T->Right = Insert(X, T->Right);
    /* Else X is in the tree already;we'll do nothing */

    return T; /* Do not forget this line!!! */
}

SearchTree
Delete(ElementType X, SearchTree T)
{
    Position TmpCell;

    if (T == NULL)
        Error("Element not found");
    else
        if (X < T->Element) /* Go left */
            T->Left = Delete(X, T->Left);
        else
            if (X > T->Element) /* Go Right */
                T->Right = Delete(X, T->Left);
            else /* Found element to be deleted */
                if (T->Left && T->Right) /*Two children */
                {
                    /* Replace with smallest in right subtree */
                    TmpCell = FindMin(T->Right);
                    T->Element = TmpCell->Element;
                    T->Right = Delete(T->Element, T->Right);
                }
                else /* One or zero children */
                {
                    TmpCell = T;
                    if (T->Left == NULL) /* Also handles 0 children */
                        T = T->Right;
                    else if (T->Right == NULL)
                        T = T->Left;
                    free(TmpCell);
                }

    return T;
}

ElementType
Retrieve(Position P)
{
    return P->Element;
}

void
PrintElement(SearchTree T)
{
    printf("%c ", Retrieve(T));
}

void
PreOrder(SearchTree T)
{
    if (T != NULL)
    {
        PrintElement(T);
        PreOrder(T->Left);
        PreOrder(T->Right);
    }
}

void
InOrder(SearchTree T)
{
    if (T != NULL)
    {
        InOrder(T->Left);
        PrintElement(T);
        InOrder(T->Right);
    }

}

void
PostOrder(SearchTree T)
{
    if (T != NULL)
    {
        PostOrder(T->Left);
        PostOrder(T->Right);
        PrintElement(T);
    }
}

main.c

/*
 *程序主函数
 */
#include "tree.h"  
#include <stdio.h>  

int main()
{
    SearchTree T = NULL;
    int i, j, m, n;
    ElementType tmp;
    printf("输入序列:");
    while (scanf_s("%c", &tmp)) {
        if (tmp == '\n')
            break;
        T = Insert(tmp, T);
    }
    printf("\n前序遍历  :");
    PreOrder(T);
    printf("\n中序遍历  :");
    InOrder(T);
    printf("\n后序遍历 :");
    PostOrder(T);
    printf("\n");
    while (1);
    return 0;
}

---

---

结果：

实验环境 vs2015