二叉树的问题

tree *tree_add(tree *root, int num)
{
    if (root == NULL)
    {
        root = (tree *)malloc(sizeof(tree));
        root->data = num;
        root->left = root->right = NULL;
        return root;
    }
    else if (root->data < num)

         root->right = tree_add(root->right, num);
    else if (root->data > num)
         root->left = tree_add(root->left, num);
    return root;
}

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
typedef struct tree tree;

struct tree
{
    int data;
    tree *left;
    tree *right;
};

tree *tree_add(tree *root, int num)
{
    if (root == NULL)
    {
        root = (tree *)malloc(sizeof(tree));
        root->data = num;
        root->left = root->right = NULL;
        return root;
    }
    else if (root->data < num)

         root->right = tree_add(root->right, num);
    else if (root->data > num)
         root->left = tree_add(root->left, num);
    return root;
}

void print_tree(tree *p)
{
    if (p->left != NULL)
        print_tree(p->left);
    printf("%d\n", p->data);
    if (p->right != NULL)
        print_tree(p->right);
}


void freeList(tree* head)
{
    if (NULL != head) {
        tree *left = head->left;
        tree *right = head->right;
        tree * tmpL;
        tree * tmpR;
        while ( NULL != left)
        {
            tmpL = left;
            left = left->left;
            free(tmpL);
        }
        while (NULL != right)
        {
            tmpR = right;
            right = right->right;
            free(tmpR);
        }
    }
   


   

}
int main()
{
    tree *root = NULL;
    int num[10] = { 5,0,4,7,8,3,2,1,6 };
    for (int i = 0; i < 10; i++)
        if (root == NULL)
            root = tree_add(root, num[i]);
        else
            tree_add(root, num[i]);
    print_tree(root);
    freeList(root);
}