#ifndef _BTREE_H_
#define _BTREE_H_
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
typedef enum{
TRUE=0;
FALSE=-1;
}Status;
typedef struct btree{
int *data;
struct btree *Lchild;
struct btree *Rchild;
}BTree;
Status InitBiTree(BTree **BT);
Status DestroyBiTree(BTree **BT);
Status CreatBiTree(BTree **BT,Difinition);
Status ClearBiTree(BTree **BT);
Status BiTreeEmpty(BTree *T);
int BiTreeDepth(BTree *T);
Status BiTreeRoot(BTree *T);
Status BiTreeValue(BTree *T,int e);
Status BiTreeAssign(BTree *T,int e,int value);
Status BiTreeParent(BTree *T,int e);
Status BiTreeLChild(BTree *T,int e);
Status BiTreeRChild(BTree *T,int e);
Status BiTreeLSibling(BTree *T,int e);
Status BiTreeRSibling(BTree *T,int e);
Status BiTreeInsertChild(BTree *T);
Status BiTreeDeleteChild(BTree *T);
Status BiTreePreOderTraverse(BTree *T);
Status BiTreeInOderTraverse(BTree *T);
Status BiTreePostOderTraverse(BTree *T);
Status BiTreeLevelOderTraverse(BTree *T);
#endif
二叉树头文件
最新推荐文章于 2024-04-29 13:16:41 发布