binary_trees.h

#ifndef BINARY_TREES_H
#define BINARY_TREES_H

/* standard header files */

#include <stdlib.h>
#include <stddef.h>
#include <stdio.h>

/* Basic Binary Tree */

/**
 * 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;

/* Binary Search Tree */

typedef struct binary_tree_s bst_t;

/* AVL Tree */

typedef struct binary_tree_s avl_t;

/* Max Binary Heap */

typedef struct binary_tree_s heap_t;

/* special print function */

void binary_tree_print(const binary_tree_t *);

/* functions prototype */

/* creates a binary tree node */
binary_tree_t *binary_tree_node(binary_tree_t *parent, int value);
/* inserts a node as the left-child of another node */
binary_tree_t *binary_tree_insert_left(binary_tree_t *parent, int value);
/* inserts a node as the right-child of another node */
binary_tree_t *binary_tree_insert_right(binary_tree_t *parent, int value);
/* deletes an entire binary tree */
void binary_tree_delete(binary_tree_t *tree);
/* checks if a node is a leaf */
int binary_tree_is_leaf(const binary_tree_t *node);
/* checks if a given node is a root */
int binary_tree_is_root(const binary_tree_t *node);
/* preorder traversal */
void binary_tree_preorder(const binary_tree_t *tree, void (*func)(int));
/* inorder traversal */
void binary_tree_inorder(const binary_tree_t *tree, void (*func)(int));
/* postorder traversal */
void binary_tree_postorder(const binary_tree_t *tree, void (*func)(int));
/* measures height */
size_t binary_tree_height(const binary_tree_t *tree);
/* measures depth */
size_t binary_tree_depth(const binary_tree_t *tree);
/* measures size */
size_t binary_tree_size(const binary_tree_t *tree);
/* count number of leaves */
size_t binary_tree_leaves(const binary_tree_t *tree);
/* count number of nodes */
size_t binary_tree_nodes(const binary_tree_t *tree);
/* measure balance factor */
int binary_tree_balance(const binary_tree_t *tree);
/* check if a binary tree is full */
int binary_tree_is_full(const binary_tree_t *tree);
/* check if a binary tree is perfect */
int binary_tree_is_perfect(const binary_tree_t *tree);
/* finds the siblings */
binary_tree_t *binary_tree_sibling(binary_tree_t *node);
/* finds the uncle */
binary_tree_t *binary_tree_uncle(binary_tree_t *node);

#endif /* BINARY_TREES_H */