|
Dan-Boat's
repositories
|
|
tests
|
|
0-binary_tree_node.c
|
|
1-binary_tree_insert_left.c
|
|
10-binary_tree_depth.c
|
|
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
|
|
102-binary_tree_is_complete.c
|
|
103-binary_tree_rotate_left.c
|
|
104-binary_tree_rotate_right.c
|
|
11-binary_tree_size.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
|
|
12-binary_tree_leaves.c
|
|
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
|
|
13-binary_tree_nodes.c
|
|
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
|
|
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
|
|
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
|
|
README.md
|
|
binary_tree_print.c
|
|
binary_trees.h
|