n-tree.c

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

struct tree {
	int k, n;
	tree **son;
};
tree *root = NULL;
tree *node;
void add(tree *);
void main()
{
	node = new tree;
	root = node;
	printf("Enter the key of the root\n");
	scanf_s("%d", &node->k);
	add(node);
	//getch();
}
void add(tree *c)
{
	int i;
	printf("Enter the number of sons\n");
	scanf_s("%d", &c->n);
	if (c->n == 0)
	{
		c->son = NULL;
		return;
	}
	c->son = new tree*[c->n];
	for (i = 0;i<c->n;i++)
	{
		c->son[i] = new tree;
		printf("Enter the key of the node %d\n", i);
		scanf_s("%d", &c->son[i]->k);
		printf("\n%d", c->son[i]->k);
	}
	for (i = 0;i<c->n;i++)
		add(c->son[i]);
}