二叉树算法c语言描述

#include <stdio.h>

typedef struct Node
{
    int data;
    struct Node * next;
}Node,*LinkList;

LinkList CreateFro,Head()
{
    LinkList L;
    Node * S;
    int n=-1,flag=1;

    L = (Node *)malloc(sizeof(Node));
    L->next=NULL;

    while(flag)
    {
        scanf("%d",&n);
        if(n!=-1)
        {
            s = (Node *)malloc(sizeof(Node));
            s->data = n;
         &