30/06/2020, 14:39
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
struct treeNode
{
struct treeNode *left;
int data;
struct treeNode *right;
};
typedef struct treeNode Tree;
typedef Tree *Treeptr;
void treeInit(Treeptr root)
{
root = NULL;
}
void insert(Treeptr *tree, int value)
{
if (*tree == NULL)
{
*tree = malloc(sizeof(Tree));
if (*tree != NULL)
{
(*tree)->data = value;
(*tree)->left = NULL;
(*tree)->right = NULL;
}
else printf("No memory available.\n");
}
else
{
if (value < (*tree)->data)
insert(&((*tree)->left), value);
else if (value > (*tree)->data)
insert(&((*tree)->right), value);
else printf("%s", "(cut)");
}
}
void print(Treeptr tree, int level) {
if (tree != NULL)
{
level++;
print(tree->right, level);
printf(">%*s%5d\n", level*5, "", tree->data);
print(tree->left, level);
level--;
}
}
int main()
{
Treeptr root;
treeInit(root);
srand(time(NULL));
puts("");
printf("Numero massimo di elementi: \n\n");
unsigned int N;
scanf("%u", &N);
for (unsigned int i = 0; i < N; ++i)
{
int value = rand() % 250;
printf("%5d", value);
insert(&root, value);
}
puts("\n\n\n");
print(root, 0);
}
01/07/2020, 13:46
01/07/2020, 14:17
01/07/2020, 14:41
Skuola.net News è una testata giornalistica iscritta al Registro degli Operatori della Comunicazione.
Registrazione: n° 20792 del 23/12/2010.
©2000—
Skuola Network s.r.l. Tutti i diritti riservati. — P.I. 10404470014.
Powered by phpBB © phpBB Group - Privacy policy - Cookie privacy
phpBB Mobile / SEO by Artodia.