ch07s014.c

稀疏矩阵、链表、图、队列、二叉树、多叉树、排序、遗传算法等的实现

NODE *AddNode(NODE *root, char *data)
{
  diff = strcmp(data, root->data);
  if(diff > 0)
  {
    if(root->left = NULL)
    {
      root->left = malloc(sizeof *root->left);

/* ... */