This project helped to understand:
- Binary Tree
- The difference between a binary tree and a Binary Search Tree
- The possible gain in terms of time complexity compared to linked list
- The depth, the height, the size of a binary tree
- The different traversal methods to go through a binary tree
- What a complete, full, perfect, balanced binary tree is
The project contains the following task:
TASK | DESCRIPTION |
---|---|
0-binary_tree_node.c |
A function that creates a binary tree node |
1-binary_tree_insert_left.c |
A function that inserts a node as the left-child of another node |