下面的程式就是下面這張表的實現：

程式實現
參考了《大話資料結構》中的定義：

typedef struct CTNode{//孩子結點
    int child;
    struct CTNode *next;
} *ChildPtr;

typedef struct{//表頭結構
    char data;
    ChildPtr firstchild;
}CTBox;

typedef struct{//樹結構
    CTBox nodes[10]; //結點陣列
    int r, n;//根的位置和結點數
}CTree;

完整程式碼：

#include <iostream>
 

using namespace std;

typedef struct CTNode{//孩子結點
    int child;
    struct CTNode *next;
} *ChildPtr;

typedef struct{//表頭結構
    char data;
    ChildPtr firstchild;
}CTBox;

typedef struct{//樹結構
    CTBox nodes[10]; //結點陣列
    int r, n;//根的位置和結點數
}CTree;

int main(){
    CTree tree;
    tree.r = 0;//根的位置是0
    tree.n = 10
 
;//10個結點

    tree.nodes[0].data = 'A';//初始化表頭結點
    tree.nodes[1].data = 'B';
    tree.nodes[2].data = 'C';
    tree.nodes[3].data = 'D';
    tree.nodes[4].data = 'E';
    tree.nodes[5].data = 'F';
    tree.nodes[6].data = 'G';
    tree.nodes[7].data = 'H';
    tree.nodes[8].data = 'I';
    tree.nodes[9].data = 'J'
 
;

    ChildPtr child1 = new CTNode;//new孩子結點 
    ChildPtr child2 = new CTNode;
    ChildPtr child3 = new CTNode;
    ChildPtr child4 = new CTNode;
    ChildPtr child5 = new CTNode;
    ChildPtr child6 = new CTNode;
    ChildPtr child7 = new CTNode;
    ChildPtr child8 = new CTNode;
    ChildPtr child9 = new CTNode;

    tree.nodes[0].firstchild = child1;//表頭結點和孩子結點連線成表
    child1->child = 1;
    child1->next = child2;
    child2->child = 2;
    child2->next = nullptr;
    tree.nodes[1].firstchild = child3;
    child3->child = 3;
    child3->next = nullptr;
    tree.nodes[2].firstchild = child4;
    child4->child = 4;
    child4->next = child5;
    child5->child = 5;
    child5->next = nullptr;
    tree.nodes[3].firstchild = child6;
    child6->child = 6;
    child6->next = child7;
    child7->child = 7;
    child7->next = child8;
    child8->child = 8;
    child8->next = nullptr;
    tree.nodes[4].firstchild = child9;
    child9->child = 9;
    child9->next = nullptr;
    tree.nodes[5].firstchild = nullptr;
    tree.nodes[6].firstchild = nullptr;
    tree.nodes[7].firstchild = nullptr;
    tree.nodes[8].firstchild = nullptr;
    tree.nodes[9].firstchild = nullptr;

    cout << tree.nodes[0].firstchild->next->child<< endl;//輸出0的第二個孩子的值
    cout << tree.nodes[3].data << endl;//輸出第四個表頭的data
    delete child1;//刪除在堆上的分配空間
    delete child2;
    delete child3;
    delete child4;
    delete child5;
    delete child6;
    delete child7;
    delete child8;
    delete child9;
    return 0;
}