src/02/01/binary_tree.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

#include "binary_tree.h"
#include <stdlib.h>

Node *initialize(int data) {
  Node *item = malloc(sizeof(Node));
  item->data = data;
  item->left = NULL;
  item->right = NULL;
  return item;
}

void preorder_traversal(Node *node, Visitor visitor) {
  if (!node)
    return;

  visitor(node);
  preorder_traversal(node->left, visitor);
  preorder_traversal(node->right, visitor);
}

void destroy(Node *head) {
  free(head);
}