数据结构与算法-实验7-二叉树基础

#define Tree_Level tree_Level(Root, 0)

struct DataType
{
    char data[9];
};
struct BinaryTree
{
    DataType  Data;
    BinaryTree* Lchild;
    BinaryTree* Rchild;
    int x;
    int y;
};

BinaryTree *Root=NULL;

BinaryTree* Grow()
{
    BinaryTree* Leaf;
    Leaf = new BinaryTree;
    Leaf->Lchild = NULL;
    Leaf->Rchild = NULL;
    strcpy_s(Leaf->Data.data,"");
    return Leaf;
}

bool tree_IsEmpty(BinaryTree* tree)
{
    if (Root==NULL)
        return 1;
    else return 0;
}

void tree_PreOrder(BinaryTree* T)
{
    if (T==NULL)
        return ;
    else
    {
        printf_s("%s
", T->Data.data);
        tree_PreOrder(T->Lchild);
        tree_PreOrder(T->Rchild);
    }
}
void tree_MidOrder(BinaryTree* T)
{
    if (T == NULL)
        return;
    else
    {
        tree_PreOrder(T->Lchild);
        printf_s("%s
", T->Data.data);
        tree_PreOrder(T->Rchild);
    }
}
void tree_BackOrder(BinaryTree* T)
{
    if (T == NULL)
        return;
    else
    {
        tree_PreOrder(T->Lchild);
        tree_PreOrder(T->Rchild);
        printf_s("%s
", T->Data.data);
    }
}

int tree_Level(BinaryTree* T,int NowLevel)//获取最大层次        
{
    int MaxLevel=0;
    if (T == NULL)
        return NowLevel-1;
    else
    {
        NowLevel++;
        int L_Level=tree_Level(T->Lchild, NowLevel);
        int R_Level=tree_Level(T->Rchild, NowLevel);
        MaxLevel = L_Level > MaxLevel ? L_Level : MaxLevel;
        MaxLevel = R_Level > MaxLevel ? R_Level : MaxLevel;
    }
    if (NowLevel > MaxLevel)
        MaxLevel = NowLevel;
    return MaxLevel;
}

#include<stdio.h>
#include<string.h>
#include"BinaryTree.h"

int tree_serch(BinaryTree* T,char* s,int Level)//level：层数
{
    if (T == NULL)
        return 0;
    else
    {
        if (!strcmp(T->Data.data, s))
        {
            return Level;
        }
        int L_Level =tree_serch(T->Lchild , s , Level + 1);
        if (L_Level != 0)
            return L_Level;

        int R_Level = tree_serch(T->Rchild, s, Level + 1);
        if (R_Level != 0)
            return R_Level;
    }
}
int tree_serch(char* s)//重载 默认情况
{
    return tree_serch(Root, s, 1);
}

30 
int main()
{
    Root                            = Grow();        strcpy_s(Root                            ->Data.data, "A");
    Root->Lchild                    = Grow();        strcpy_s(Root->Lchild                    ->Data.data, "B");
    Root->Lchild->Rchild            = Grow();        strcpy_s(Root->Lchild->Rchild            ->Data.data, "D");
    Root->Lchild->Rchild->Lchild    = Grow();        strcpy_s(Root->Lchild->Rchild->Lchild    ->Data.data, "F");
    Root->Lchild->Rchild->Rchild    = Grow();        strcpy_s(Root->Lchild->Rchild->Rchild    ->Data.data, "G");
    Root->Rchild                    = Grow();        strcpy_s(Root->Rchild                    ->Data.data, "C");
    Root->Rchild->Rchild            = Grow();        strcpy_s(Root->Rchild->Rchild            ->Data.data, "E");
    Root->Rchild->Rchild->Rchild    = Grow();        strcpy_s(Root->Rchild->Rchild->Rchild    ->Data.data, "H");
    

    printf_s("请输入要搜索的结点
");
    char s[9] = {0};
    scanf_s("%s", s,sizeof(s));
    printf_s("%d
", tree_serch(s));
    return 0;
}