binary_trees.h

#ifndef BINARY_TREES_H
#define BINARY_TREES_H

#include <stddef.h>
#include <stdlib.h>
#include <limits.h>
/**
 * struct binary_tree_s - Binary tree node
 *
 * @n: Integer stored in the node
 * @parent: Pointer to the parent node
 * @left: Pointer to the left child node
 * @right: Pointer to the right child node
 */
struct binary_tree_s
{
	int n;
	struct binary_tree_s *parent;
	struct binary_tree_s *left;
	struct binary_tree_s *right;
};
typedef struct binary_tree_s binary_tree_t;
typedef struct binary_tree_s bst_t;
typedef struct binary_tree_s avl_t;
typedef struct binary_tree_s heap_t;
/**
 * struct QueueNode - Queue node
 *
 * @treeNode: Pointer to the binary tree node
 * @next: Pointer to the next node in the queue
 */

typedef struct QueueNode
{
	binary_tree_t *treeNode;
	struct QueueNode *next;
} QueueNode;

/**
 * struct Queue - Queue
 *
 * @front: Pointer to the first node in the queue
 * @rear: Pointer to the last node in the queue
 */
typedef struct Queue
{
	QueueNode *front;
	QueueNode *rear;
} Queue;

void binary_tree_print(const binary_tree_t *);
binary_tree_t *binary_tree_node(binary_tree_t *parent, int value);
binary_tree_t *binary_tree_insert_left(binary_tree_t *parent, int value);
binary_tree_t *binary_tree_insert_right(binary_tree_t *parent, int value);
void binary_tree_delete(binary_tree_t *tree);
size_t binary_tree_height(const binary_tree_t *tree);
size_t binary_tree_depth(const binary_tree_t *tree);
size_t binary_tree_size(const binary_tree_t *tree);
size_t binary_tree_nodes(const binary_tree_t *tree);
int binary_tree_balance(const binary_tree_t *tree);
int binary_tree_is_full(const binary_tree_t *tree);
int binary_tree_is_leaf(const binary_tree_t *node);
int binary_tree_is_root(const binary_tree_t *node);
int binary_tree_is_perfect(const binary_tree_t *tree);
binary_tree_t *binary_tree_sibling(binary_tree_t *node);
binary_tree_t *binary_tree_uncle(binary_tree_t *node);
void binary_tree_preorder(const binary_tree_t *tree, void (*func)(int));
void binary_tree_inorder(const binary_tree_t *tree, void (*func)(int));
void binary_tree_postorder(const binary_tree_t *tree, void (*func)(int));
binary_tree_t *binary_trees_ancestor(const binary_tree_t *first,
				     const binary_tree_t *second);
void binary_tree_levelorder(const binary_tree_t *tree, void (*func)(int));

void binary_tree_levelorder_recursive(const binary_tree_t *tree,
				      size_t level, void (*func)(int));
size_t binary_tree_leaves(const binary_tree_t *tree);
int binary_tree_is_complete(const binary_tree_t *tree);
Queue *createQueue();
void enqueue(Queue *queue, binary_tree_t *treeNode);
binary_tree_t *dequeue(Queue *queue);
int isQueueEmpty(Queue *queue);
bst_t *bst_insert(bst_t **tree, int value);
#endif