#include <stdio.h>
#include<stdlib.h>
//树的孩子兄弟表示法
//一个指针指向孩子一个指针指向孩子的兄弟
//数据集合
typedef struct ChildBro
{
int key;
struct ChildBro* child;//指向孩子的指针
struct ChildBro* sibling;//指向兄弟的指针
}Node;
//操作集合
void Init(int key)
{
Node* root = (Node*)malloc(sizeof(Node));
root->key = key;
root->child = NULL;
root->sibling = NULL;
return root;
}
//插入
void insert(int key, int parent)
{
//定位--递归
Node* tempNode;//
if (tempNode == NULL)
{
//没有该节点
}
else
{
if (tempNode->child == NULL)
{
Node* node = (Node*)malloc(sizeof(Node));
node->key = key;
node->child = NULL;
node->sibling = NULL;
tempNode->child = node;
}
else
{
tempNode = tempNode->child;//?
Node* node = (Node*)malloc(sizeof(Node));
node->key = key;
node->child = NULL;
//头插
node->sibling = tempNode->sibling;
tempNode->sibling = node;
}
}
}