二叉树的表示

• 二叉链表示法

#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;
}