Project done during Full Stack Software Engineering studies at ALX. The project is on the Binary Tree done with C language.
- C files are compiled using
gcc 4.8.4 - C files are written according to the C90 standard
- Tested on Ubuntu 20.04 LTS
All of the following files are programs written in C:
| Filename | Description |
|---|---|
0-binary_tree_node.c |
function that creates a binary tree node |
1-binary_tree_insert_left.c |
function that inserts a node as the left-child of another node |
2-binary_tree_insert_right.c |
function that inserts a node as the right-child of another node |
3-binary_tree_delete.c |
a function that deletes an entire binary tree |
4-binary_tree_is_leaf.c |
a function that checks if a node is a leaf |
5-binary_tree_is_root.c |
a function that checks if a given node is a root |
6-binary_tree_preorder.c |
a function that goes through a binary tree using pre-order traversal |
7-binary_tree_inorder.c |
a function that goes through a binary tree using in-order traversal |
8-binary_tree_postorder.c |
a function that goes through a binary tree using post-order traversal |
9-binary_tree_height.c |
function that measures the height of a binary tree |
10-binary_tree_depth.c |
function that measures the depth of a node in a binary tree |
11-binary_tree_size.c |
function that measures the size of a binary tree |
12-binary_tree_leaves.c |
function that counts the leaves in a binary tree |
13-binary_tree_nodes.c |
function that counts the nodes with at least 1 child in a binary tree |
14-binary_tree_balance.c |
measures the balance factor of a binary tree |
15-binary_tree_is_full.c |
checks if a binary tree is full |
16-binary_tree_is_perfect.c |
checks if a binary tree is perfect |
17-binary_tree_sibling.c |
finds the sibling of a node |
18-binary_tree_uncle.c |
finds the uncle of a node |