二叉树

/*************************************************************************
    > File Name: tree.c
    > Author: Jukay
    > Mail: hellojukay@gmail.com 
    > Created Time: 2014年11月10日 星期一 18时04分59秒
 ************************************************************************/

#include<stdio.h>
#include<stdlib.h>

struct node 
{
 int date;
 struct node *left;
 struct node *right;
};

struct node * create(int n)
{
 struct node *head;
 head = (struct node *)malloc(sizeof(struct node));
 head ->date = n;
 head ->left = NULL;
 head ->right = NULL;
 return head;
}

void insert(struct node **root,int n)
{
 if(*root == NULL)
 {
 *root = (struct node *)malloc(sizeof(struct node));
 (*root) ->date =n;
 (*root) ->left = NULL;
 (*root) ->right = NULL;
 }
 else if(n <= (*root) ->date)
 insert(&((*root) ->left), n);
 else insert(&((*root) ->right), n);
}

void print(struct node * root)
{
 if(root != NULL)
 {
 printf("%d",root ->date);
 print(root ->left);
 print(root ->right);
 }
}

int main()
{
 struct node *root;
 root = create(4);
 insert(&root,3);
 insert(&root,5);
 insert(&root,0);
 print(root);
 return 0;
}
=-=-=-=-=
Powered by Blogilo