A deep exploration of Binary Trees as a Data structure using C language.
- 0-binary_tree_node.c
- 0-node
- 100-ancestor
- 100-binary_trees_ancestor.c
- 100-long_binary_trees_ancestor.c
- 100-short_binary_trees_ancestor.c
- 101-binary_tree_levelorder.c
- 101-binary_tree_levelorder_recursive.c
- 101-lvl
- 102-binary_tree_is_complete.c
- 102-complete
- 103-binary_tree_rotate_left.c
- 103-rotl
- 104-binary_tree_rotate_right.c
- 104-rotr
- 10-binary_tree_depth.c
- 10-depth
- 110-binary_tree_is_bst.c
- 110-is_bst
- 110-old_binary_tree_is_bst.c
- 111-bst_insert
- 111-bst_insert.c
- 112-array_to_bst.c
- 112-bst_array
- 113-bst_search
- 113-bst_search.c
- 114-bst_remove.c
- 114-bst_rm
- 115-O
- 11-binary_tree_size.c
- 11-size
- 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
- 12-binary_tree_leaves.c
- 12-leaves
- 130-binary_tree_is_heap.c
- 131-heap_insert.c
- 132-array_to_heap.c
- 133-heap_extract.c
- 134-heap_to_sorted_array.c
- 135-O
- 13-binary_tree_nodes.c
- 13-nodes
- 14-balance
- 14-binary_tree_balance.c
- 15-binary_tree_is_full.c
- 15-full
- 16-binary_tree_is_perfect.c
- 16-perfect
- 17-binary_tree_sibling.c
- 17-sibling
- 18-binary_tree_uncle.c
- 18-uncle
- 1-binary_tree_insert_left.c
- 1-left
- 2-binary_tree_insert_right.c
- 2-right
- 3-binary_tree_delete.c
- 3-del
- 4-binary_tree_is_leaf.c
- 4-leaf
- 5-binary_tree_is_root.c
- 5-root
- 6-binary_tree_preorder.c
- 6-pre
- 7-binary_tree_inorder.c
- 7-in
- 8-binary_tree_postorder.c
- 8-post
- 9-binary_tree_height.c
- 9-height
- binary_tree_print.c
- binary_trees.h
- README.md
- tests