Project done during Full Stack Software Engineering studies at ALX Africa. It aims to learn about what is a binary tree, the different traversal methods to go through a binary tree (pre-order, in-order and post-order) and the different types of binary trees (complete, full, perfect and balanced).
| 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 | Function that deletes an entire binary tree |
| 4-binary_tree_is_leaf.c | Funciton that checks if a node is a leaf |
| 5-binary_tree_is_root.c | Function that checks if a given node is a root |
| 6-binary_tree_preorder.c | Function that goes through a binary tree using pre-order traversal |
| 7-binary_tree_inorder.c | Function that goes through a binary tree using in-order traversal |
| 8-binary_tree_postorder.c | 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 | Funciton 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 | Function that measures the balance factor of a binary tree |
| 15-binary_tree_is_full.c | Function that checks if a binary tree is full |
| 16-binary_tree_is_perfect.c | Function that checks if a binary tree is perfect |
| 17-binary_tree_sibling.c | Function that finds the sibling of a node |
| 18-binary_tree_uncle.c | Function that finds the uncle of a node |
main directory - it conatins all the main.c files used to test each functions in the directory