Made by :
C#25 - Holberton School - Toulouse
| Binary Trees | Description |
|---|---|
| 0-binary_tree_node.c | Creation of a new parent node |
| 1-binary_tree_insert_left.c | Insert a left child node |
| 2-binary_tree_insert_right.c | Insert a right child node |
| 3-binary_tree_delete.c | Free a binary tree |
| 4-binary_tree_is_leaf.c | Check if node is a leaf o the binary tree |
| 5-binary_tree_is_root.c | Check if given node is root |
| 6-binary_tree_preorder.c | Goes throught binary tree pre-order traversal |
| 7-binary_tree_inorder.c | Goes throught binary tree in-order traversal |
| 8-binary_tree_postorder.c | Goes throught binary tree post-order traversal |
| 9-binary_tree_height.c | Measure the height of a node |
| 10-binary_tree_depth.c | Measures the depth of a node |
| 11-binary_tree_size.c | Measures the size of a binary tree |
| 12-binary_tree_leaves.c | Check if the node is a leaf or not |
| 13-binary_tree_nodes.c | Count the node with at least 1 child in a binary tree |
| 14-binary_tree_balance.c | Check if a node of a tree is balanced |
| 15-binary_tree_is_full.c | Check if a tree is full or not |
| 16-binary_tree_is_perfect.c | Check if the tree is perfect starting from a node |
| 17-binary_tree_sibling.c | Find the sibling of a node if it exists |
| 18-binary_tree_uncle.c | Find the uncle node of a node if it exists |