Started implementing a self-balancing binary tree data structure

sandbox/btree/btree.c

@@ -0,0 +1,37 @@
+#include "include/socks/btree.h"
+#include <socks/bree.h>
+
+static void insert_fixup(btree_t *tree, btree_node_t *node)
+{
+
+}
+
+void btree_insert(btree_t *tree, btree_node_t *node)
+{
+	if (!tree->b_root) {
+		tree->b_root = node;
+		return;
+	}
+
+	btree_node_t *cur = tree->b_root;
+	while (1) {
+		btree_node_t **nextp = NULL;
+		
+		if (node->b_key >= cur->b_key) {
+			nextp = &cur->b_right;
+		} else {
+			nextp = &cur->b_left;
+		}
+
+		if (*nextp) {
+			cur = *nextp;
+		} else {
+			*nextp = node;
+			break;
+		}
+	}
+
+	insert_fixup(tree, node);
+}
+
+void btree_delete(btree_t *tree, btree_node_t *node) {}