c语言-孩子兄弟树的实现

最新推荐文章于 2022-01-12 20:51:52 发布

Xiaoweidumpb

最新推荐文章于 2022-01-12 20:51:52 发布

阅读量230

点赞数

分类专栏： # 数据结构

本文链接：https://blog.csdn.net/qq_43751489/article/details/111028710

版权

数据结构专栏收录该内容

25 篇文章 2 订阅

订阅专栏

#pragma once

#include<stdio.h>
#include<malloc.h>
#include<assert.h>

#define ElemType char

typedef struct TreeNode
{
    ElemType data;
    struct TreeNode *firstChild;    //����㿴�� ��Ϊ���ӣ���Ϊ�ֵ�
    struct TreeNode *nextSibling;

}TreeNode;

typedef struct Tree
{
    TreeNode *root;
    ElemType refvalue;
}Tree;

void InitTree(Tree *tree,ElemType ref);

void CreateTree(Tree *tree,char *str);
void CreateTree(Tree *tree,TreeNode *&t,char *&str);

TreeNode* Root(Tree *tree);
TreeNode* FirstChild(Tree *tree);
TreeNode* FirstChild(TreeNode *t);

TreeNode* NextSibling(Tree *tree);
TreeNode* NextSibling(TreeNode *t);

TreeNode* Find(Tree *tree,ElemType key);
TreeNode* Find(TreeNode *t,ElemType key);

#include"Tree.h"

void main(){
    Tree tree;
    InitTree(&tree,'#');

    char *str="RAD#E##B#CFG#H#K#####";
    CreateTree(&tree,str);


    TreeNode *p=Find(&tree,'B');
}

#include"Tree.h"

void InitTree(Tree *tree,ElemType ref){
    tree->root=NULL;
    tree->refvalue=ref;

}

void CreateTree(Tree *tree,char *str){
    CreateTree(tree,tree->root,str);
}
void CreateTree(Tree *tree,TreeNode *&t,char *&str){
    if(*str==tree->refvalue)
        t=NULL;
    else
    {
        t=(TreeNode*)malloc(sizeof(TreeNode));
        assert(t!=NULL);
        t->data=*str;
        CreateTree(tree,t->firstChild,++str);
        CreateTree(tree,t->nextSibling,++str);

    }
}


TreeNode* Root(Tree *tree){
    return tree->root;
}

TreeNode* FirstChild(Tree *tree){
    return FirstChild(tree->root);
}
TreeNode* FirstChild(TreeNode *t){
    if(t==NULL)
        return NULL;
    return t->firstChild;
}

TreeNode* NextSibling(Tree *tree){
    return tree->root;
}
TreeNode* NextSibling(TreeNode *t){
    if(t==NULL)
        return NULL;
    return t->nextSibling;
}

TreeNode* Find(Tree *tree,ElemType key){
    return Find(tree->root,key);
}
TreeNode* Find(TreeNode *t,ElemType key){
    if(t==NULL)
        return NULL;
    if(t->data==key)
        return t;
    
    TreeNode *p=Find(t->firstChild,key);
    return Find(t->nextSibling,key);
    
}