#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
struct _bitTree
{
int data;
struct _bitTree * lchild, *rchild;
};
typedef struct _bitTree BiTNode;
typedef struct _bitTree* BiTreee;
int main(void)
{
BiTNode t1, t2, t3, t4, t5;
t1.data = 1;
t2.data = 2;
t3.data = 3;
t4.data = 4;
t5.data = 5;
t1.lchild = &t2;
t1.rchild = &t3;
t2.lchild = &t4;
t3.lchild = &t5;
system("pause");
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
typedef struct TriTNode
{
int data;
struct TriTNode *lchild, *rchild;
struct TriTNode *parent;
}TriTNode, *TriTree;
int main(void)
{
TriTNode t1, t2, t3, t4, t5;
t1.data = 1;
t2.data = 2;
t3.data = 3;
t4.data = 4;
t5.data = 5;
t1.lchild = &t2;
t2.parent = &t1;
t1.rchild = &t3;
t3.parent = &t1;
t2.lchild = &t4;
t4.parent = &t2;
t3.lchild = &t5;
t5.parent = &t3;
system("pause");
return 0;
}
#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
#define MAX_TREE_SIZE 100
typedef struct BPTNode
{
int data;
int parentPosition;
char LRTag;
}BPTNode;
typedef struct BPTree
{
BPTNode nodes[100];
int num_node;
int root;
}BPTree;
int main(void)
{
BPTree tree;
tree.nodes[0].parentPosition = 10000;
tree.nodes[1].parentPosition = 0;
tree.nodes[1].data = 'B';
tree.nodes[1].LRTag = 1;
tree.nodes[2].parentPosition = 0;
tree.nodes[3].data = 'C';
tree.nodes[2].LRTag = 2;
system("pause");
return 0;
}