#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
typedef struct node_tag
{
int data;
struct node_tag* left;
struct node_tag* right;
} Tree;
void insert(Tree** rt, int num)
{
Tree* tmp;
if (*rt == NULL)
{
tmp = (Tree*)malloc(sizeof(Tree));
if (tmp == NULL)
{
fprintf(stderr, "malloc error ");
exit(1);
}
tmp->data = num;
*rt = tmp;
}
else
{
if (num > (*rt)->data) {
insert(&(*rt)->right, num);
}
else {
insert(&(*rt)->left, num);
}
}
}
void print_nodes(Tree* root)
{
if (root == NULL)
{
return;
}
if (root->left != NULL)
{
print_nodes(root->left);
}
printf("data= %d\n", root->data);
if (root->right != NULL)
{
print_nodes(root->right);
}
}
int main(int argc, char** argv)
{
Tree* root = NULL;
int arr[] = {
415,
456,
56,
156,
51,
21,
54,
3,
15,
651,
};
int length;
length = sizeof(arr) / sizeof(arr[0]);
for (int i = 0; i < length; i++)
{
insert(&root, arr[i]);
}
print_nodes(root);
return 0;
}