YUCOAT

/*
作者：YUCOAT
日期：2012-4-16
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>    // for bool
#include <pthread.h>

struct BinTree
{
    int Data;
    struct BinTree *Left;
    struct BinTree *Right;
};
typedef struct BinTree BinTree;


//创建二叉排序树（非递归）
BinTree* Insert(BinTree *node, const int value)
{
    //Create a node
    BinTree *temp = (BinTree *)malloc(sizeof (BinTree));
    temp->Data = value;
    temp->Left = NULL;
    temp->Right = NULL;

    // node == NULL
    if (node == NULL)
        return temp;

    //Insert to Bin tree
    BinTree *flag = node;
    while (1)
    {
        if (flag->Data == value)
        {
            free(temp);
            return node;
        }
        else if (flag->Data < value && flag->Right == NULL)
        {
            flag->Right = temp;
            return node;
        }
        else if(flag->Data < value && flag->Right != NULL)
            flag = flag->Right;
        else if (flag->Data > value && flag->Left == NULL)
        {
            flag->Left = temp;
            return node;
        }
        else if( flag->Data > value && flag->Left != NULL)
            flag = flag->Left;
    }
}

void *read_tree(void *binTree)
{
    BinTree *temp = (BinTree *)binTree;

    if (temp == NULL)
        return NULL;
    else
        printf("%d\n", temp->Data);
    read_tree((void *)temp->Right);
    read_tree((void *)temp->Left);
    return NULL;
}

void Traverse(BinTree *head)
{
    pthread_t pth_one, pth_two;
    int p_one, p_two;
    if (head == NULL)
    {
        printf("Tree is empty!");
        return;
    }
    printf("%d\n", head->Data);
    p_one=pthread_create(&pth_one, NULL, read_tree, (void *)head->Right);
    p_two=pthread_create(&pth_two, NULL, read_tree, (void *)head->Left);
    if (p_one != 0 || p_two != 0)
    {
        perror("pthread_create");
        exit(1);
    }
    pthread_join(pth_one, NULL);
    pthread_join(pth_two, NULL);
}
int main()
{
    BinTree *head = NULL;
    int buf;

    while (scanf("%d", &buf) && buf != 0)
        head = Insert(head, buf);
    if(head == NULL)
        printf("xxxx");
    Traverse(head);
    return 0;
}