0x1D. C - Binary trees

About

C is a powerful general-purpose programming language. It can be used to develop software like operating systems, databases, compilers, and so on. This projects covers the concepts of binary trees!

• This repository consists of a project on Binary trees (low level programming) done with ALX Africa Full stack Software Engineering course in partnership with Holberton School by victorpreston.

Resource

• Binary tree (note the first line: Not to be confused with B-tree.)
• Data Structure and Algorithms - Tree
• Tree Traversal
• Binary Search Tree
• Data structures: Binary Tree

Data structures

• Links from screenshot
  • Print function

Tasks

Filename
0-binary_tree_node.c
1-binary_tree_insert_left.c
2-binary_tree_insert_right.c
3-binary_tree_delete.c
4-binary_tree_is_leaf.c
5-binary_tree_is_root.c
6-binary_tree_preorder.c
7-binary_tree_inorder.c
8-binary_tree_postorder.c
9-binary_tree_height.c
10-binary_tree_depth.c
11-binary_tree_size.c
12-binary_tree_leaves.c
13-binary_tree_nodes.c
14-binary_tree_balance.c
15-binary_tree_is_full.c
16-binary_tree_is_perfect.c
17-binary_tree_sibling.c
18-binary_tree_uncle.c
100-binary_trees_ancestor.c
101-binary_tree_levelorder.c
102-binary_tree_is_complete.c
103-binary_tree_rotate_left.c
104-binary_tree_rotate_right.c
110-binary_tree_is_bst.c
111-bst_insert.c
112-array_to_bst.c
113-bst_search.c
114-bst_remove.c
115-O
120-binary_tree_is_avl.c
121-avl_insert.c
122-array_to_avl.c
123-avl_remove.c
124-sorted_array_to_avl.c
125-O
130-binary_tree_is_heap.c
131-heap_insert.c - Task pending
132-array_to_heap.c - Task pending
133-heap_extract.c - Task pending
134-heap_to_sorted_array.c - Task pending
135-O