56 lines
875 B
C
56 lines
875 B
C
/**
|
|
* tree_print.c
|
|
*
|
|
* Creation Date: 27/03/2019
|
|
*
|
|
* Authors:
|
|
* Leonardo Vencovsky (https://github.com/LeoVen)
|
|
*
|
|
*/
|
|
#include "cmc/treeset.h"
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
|
|
CMC_GENERATE_TREESET(set, set, int);
|
|
typedef struct set set;
|
|
typedef struct set_iter set_iter;
|
|
typedef struct set_node set_node;
|
|
|
|
|
|
void print_tree(set_node *root, int height)
|
|
{
|
|
if (!root)
|
|
return;
|
|
|
|
print_tree(root->right, height + 1);
|
|
|
|
for (int i = 0; i < height; i++)
|
|
printf("|------- ");
|
|
|
|
printf("%d\n", root->value);
|
|
|
|
print_tree(root->left, height + 1);
|
|
}
|
|
|
|
int intcmp(int a, int b)
|
|
{
|
|
return a - b;
|
|
}
|
|
|
|
int main(int argc, char const *argv[])
|
|
{
|
|
set *set1 = set_new(intcmp);
|
|
|
|
for (int i = 0; i < 31; i++)
|
|
{
|
|
set_insert(set1, i);
|
|
}
|
|
|
|
print_tree(set1->root, 0);
|
|
|
|
set_free(set1, NULL);
|
|
|
|
return 0;
|
|
}
|