1#include "btree.h"
 2#include <stdio.h>
 3#include <stdlib.h>
 4
 5int main(int argc, char *argv[]) {
 6  printf("=== COMP-272 - Assignment 02 - Question 05 ===\n");
 7  BTree *tree = btree_insert(NULL, 10);
 8  btree_insert(tree, 5);
 9  btree_insert(tree, 15);
10  btree_insert(tree, 7);
11  btree_insert(tree, 12);
12  btree_insert(tree, 18);
13  btree_insert(tree, 3);
14  btree_inspect(tree);
15
16  btree_pre_order_number(tree);
17  btree_in_order_number(tree);
18  btree_post_order_number(tree);
19
20  printf("Pre order traversal:\n");
21  for (int i = 0; i < 32; i++)
22    printf("%d ", tree->pre_order[i]);
23  printf("\n");
24  printf("\n");
25
26  printf("In order traversal:\n");
27  for (int i = 0; i < 32; i++)
28    printf("%d ", tree->in_order[i]);
29  printf("\n");
30  printf("\n");
31
32  printf("Post order traversal:\n");
33  for (int i = 0; i < 32; i++)
34    printf("%d ", tree->post_order[i]);
35  printf("\n");
36  printf("\n");
37
38  printf("Bye\n");
39  return 0;
40}