Shitty program

Hi /prog/. I'm learning C, and wrote a program that takes a bunch of numbers and sorts them using a binary tree. I know it's not an efficient way to sort, I'm just learning binary trees. Could you look over it real quick and just give me some comments, like if there was something you would have done differently or something that's just stupid. Thanks a lot.

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

struct node_ {
        int value;
        struct node_ *left, *right;
};

typedef struct node_ node;

node *insert(node *parent, int newval)
{
        if (!parent) {
                node *n = malloc(sizeof(node));
                n->value = newval;
                return n;
        }
        else if (newval == parent->value)
                return parent;
        else if (newval < parent->value) {
                parent->left = insert(parent->left, newval);
                return parent;
        }
        else {
                parent->right = insert(parent->right, newval);
                return parent;
        }
}

void print(node *top)
{
        if (!top)
                return;

        print(top->left);
        printf("%d ", top->value);
        print(top->right);
}

int main(int argc, char *argv[])
{
        puts("enter values, 0 to stop");
       
        int next;
        scanf("%d", &next);
       
        node *root = 0;
       
        while (next) {
                root = insert(root, next);
                scanf("%d", &next);
        }

        print(root);
        puts("");

        return 0;
}

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

struct node { int value; struct node *left, *right; } node

node *insert(node *parent, int newval)
{ if(!parent) parent = memcpy(malloc(sizeof(node)), &(node) { .value = newval; }, sizeof(node));
  else if(newval < parent->value) parent->left = insert(parent->left, newval);
  else if(newval > parent->value) parent->right = insert(parent->right, newval);
  return parent ; }

void print(node *top)
{ if(top)
  { print(top->left);
    printf("%d ", top->value);
    print(top->right); }}

int main(int argc, char *argv[argc])
{ int next;
  node *root = 0;
  puts("enter value, 0 to stop");
  for(scanf("%d", &next); next; scanf("%d", &next)) insert(root, next);
  print(root);
  putchar('\n');
  return 0; }

making insert tail-recursive and then doing tail call optimization on it is left as an exercise for the reader.