Complete preorder traversal of a binary tree

1 files changed, 23 insertions, 0 deletions

diff --git a/src/02/01/binary_tree.c b/src/02/01/binary_tree.c
new file mode 100644
index 0000000..c0f3f09
--- /dev/null
+++ b/src/02/01/binary_tree.c
@@ -0,0 +1,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_next(Node *node, Visitor visitor) {
+  if (!node)
+    return;
+
+  visitor(node);
+  preorder_next(node->left, visitor);
+  preorder_next(node->right, visitor);
+}
+
+void destroy(Node *head) {
+  free(head);
+}