#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "btree.h"

struct BTree_head * init_head(void)
{
	struct BTree_head *head = malloc(sizeof(struct BTree_head));

	if (head == NULL)
		return NULL;

	head->root = NULL;
	head->height = 0;
	head->order = 0;
	head->num_recs = 0;

	return head;
}

void destroy_head(struct BTree_head *head)
{
	free(head);
}

struct BTree_node * new_node(void)
{
	struct BTree_node *new = malloc(sizeof(struct BTree_node));

	if (new != NULL)
		memset(new, 0, sizeof(struct BTree_node));

	return new;
}

void destroy_node(struct BTree_node *node)
{
	if (node)
		free(node);
}

int btree_add(struct Data *item)
{
	return 0;
}

int btree_delete(void)
{
	return 0;
}

int btree_search(void)
{
	return 0;
}

int btree_dump(void)
{
	return 0;
}

void usage(void)
{
	return;
}