BinaryTree/BinaryTree.h at master · Ironsongming/BinaryTree · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
typedef int Item;
typedef int boolean;

typedef struct node{
	struct node *lChild;
	struct node *rChild;
	Item data;
}Node,BinaryTree;


BinaryTree * InitBiTree();

void DestroyBiTree(BinaryTree * binaryTree);

BinaryTree * CreateBiTree();

void ClearBiTree(BinaryTree * binaryTree);

boolean BiTreeEmpty(BinaryTree * binaryTree);

int BiTreeDepth(BinaryTree * binaryTree);

Node * Root(BinaryTree * binaryTree);

Item Value(BinaryTree * binaryTree,Node * e);

void Assign(BinaryTree * binaryTree,Node * e,Item new_data);

Node * Parent(BinaryTree * binaryTree,Node * e);

Node * LeftChild(BinaryTree * binaryTree,Node * e);

Node * RightChild(BinaryTree * binaryTree,Node * e);

Node * LeftSibling(BinaryTree * binaryTree,Node * e);

Node * RightSibling(BinaryTree * binaryTree,Node * e);

boolean InsertChild(BinaryTree * binaryTree,Node *p,int LR,Node * node);

boolean DeleteChild(BinaryTree * binaryTree,Node *p,int LR);

void PreOrderTraverse(BinaryTree * binaryTree,void(*visit)());

void InOrderTraverse(BinaryTree * binaryTree,void(*visit)());

void PostOrderTraverse(BinaryTree * binaryTree,void(*visit)());

void LevelOrderTraverse(BinaryTree * binaryTree,void(*visit)());

//下面是辅助函数
//遍历二叉树和调用Assign函数修改结点的Item值
void scanAndchangeBiTree(BinaryTree * binaryTree,void(*change)());
//换行
void newLine();
//创建新的结点
Node * CreateNode();