C - Binary Trees

Learning Objectives 📃 ✔️

• What is a binary tree
• What is the difference between a binary tree and a Binary Search Tree
• What is the possible gain in terms of time complexity compared to linked lists
• What are the depth, the height, the size of a binary tree
• What are the different traversal methods to go through a binary tree
• What is a complete, a full, a perfect, a balanced binary tree

Header file 📃

• binary_trees.h Header file containing definitions and prototypes for all types and functions written for the tasks.

Taks 📃

• 0. 0-binary_tree_node.c
• 1. 1-binary_tree_insert_left.c
• 2. 2-binary_tree_insert_right.c
• 3. 3-binary_tree_delete.c
• 4. 4-binary_tree_is_leaf.c
• 5. 5-binary_tree_is_root.c
• 6. 6-binary_tree_preorder.c
• 7. 7-binary_tree_inorder.c
• 8. 8-binary_tree_postorder.c
• 9. 9-binary_tree_height.c
• 10. 10-binary_tree_depth.c
• 11. 11-binary_tree_size.c
• 12. 12-binary_tree_leaves.c
• 13. 13-binary_tree_nodes.c
• 14. 14-binary_tree_balance.c
• 15. 15-binary_tree_is_full.c
• 16. 16-binary_tree_is_perfect.c
• 17. 17-binary_tree_sibling.c
• 18. 18-binary_tree_uncle.c

By Felipe Pereira and Laura Ballesté as part of the Holberton Uruguay study program.