Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
.gitignore
.gitignore
 
 
0-binary_tree_node.c
0-binary_tree_node.c
 
 
0-node
0-node
 
 
1-binary_tree_insert_left.c
1-binary_tree_insert_left.c
 
 
1-left
1-left
 
 
10-binary_tree_depth.c
10-binary_tree_depth.c
 
 
10-depth
10-depth
 
 
100-ancestor
100-ancestor
 
 
100-binary_trees_ancestor.c
100-binary_trees_ancestor.c
 
 
101-binary_tree_levelorder.c
101-binary_tree_levelorder.c
 
 
101-lvl
101-lvl
 
 
102-binary_tree_is_complete.c
102-binary_tree_is_complete.c
 
 
102-complete
102-complete
 
 
103-binary_tree_rotate_left.c
103-binary_tree_rotate_left.c
 
 
103-rotl
103-rotl
 
 
104-binary_tree_rotate_right.c
104-binary_tree_rotate_right.c
 
 
104-rotr
104-rotr
 
 
11-binary_tree_size.c
11-binary_tree_size.c
 
 
11-size
11-size
 
 
110-binary_tree_is_bst.c
110-binary_tree_is_bst.c
 
 
110-is_bst
110-is_bst
 
 
111-bst_insert
111-bst_insert
 
 
111-bst_insert.c
111-bst_insert.c
 
 
112-array_to_bst.c
112-array_to_bst.c
 
 
112-bst_array
112-bst_array
 
 
113-bst_search
113-bst_search
 
 
113-bst_search.c
113-bst_search.c
 
 
114-bst_remove.c
114-bst_remove.c
 
 
114-bst_rm
114-bst_rm
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
12-leaves
12-leaves
 
 
120-binary_tree_is_avl.c
120-binary_tree_is_avl.c
 
 
120-is_avl
120-is_avl
 
 
121-avl_insert
121-avl_insert
 
 
121-avl_insert.c
121-avl_insert.c
 
 
122-array_to_avl.c
122-array_to_avl.c
 
 
122-avl_array
122-avl_array
 
 
123-avl_remove.c
123-avl_remove.c
 
 
123-avl_rm
123-avl_rm
 
 
124-avl_sorted
124-avl_sorted
 
 
124-sorted_array_to_avl.c
124-sorted_array_to_avl.c
 
 
13-binary_tree_nodes.c
13-binary_tree_nodes.c
 
 
13-nodes
13-nodes
 
 
130-binary_tree_is_heap.c
130-binary_tree_is_heap.c
 
 
130-is_heap
130-is_heap
 
 
131-heap_insert
131-heap_insert
 
 
131-heap_insert.c
131-heap_insert.c
 
 
132-array_to_heap.c
132-array_to_heap.c
 
 
132-heap_array
132-heap_array
 
 
133-heap_extract.c
133-heap_extract.c
 
 
134-heap_to_sorted_array.c
134-heap_to_sorted_array.c
 
 
14-balance
14-balance
 
 
14-binary_tree_balance.c
14-binary_tree_balance.c
 
 
15-binary_tree_is_full.c
15-binary_tree_is_full.c
 
 
15-full
15-full
 
 
16-binary_tree_is_perfect.c
16-binary_tree_is_perfect.c
 
 
16-perfect
16-perfect
 
 
17-binary_tree_sibling.c
17-binary_tree_sibling.c
 
 
17-sibling
17-sibling
 
 
18-binary_tree_uncle.c
18-binary_tree_uncle.c
 
 
18-uncle
18-uncle
 
 
2-binary_tree_insert_right.c
2-binary_tree_insert_right.c
 
 
2-right
2-right
 
 
3-binary_tree_delete.c
3-binary_tree_delete.c
 
 
3-del
3-del
 
 
4-binary_tree_is_leaf.c
4-binary_tree_is_leaf.c
 
 
4-leaf
4-leaf
 
 
5-binary_tree_is_root.c
5-binary_tree_is_root.c
 
 
5-root
5-root
 
 
6-binary_tree_preorder.c
6-binary_tree_preorder.c
 
 
6-pre
6-pre
 
 
7-binary_tree_inorder.c
7-binary_tree_inorder.c
 
 
7-in
7-in
 
 
8-binary_tree_postorder.c
8-binary_tree_postorder.c
 
 
8-post
8-post
 
 
9-binary_tree_height.c
9-binary_tree_height.c
 
 
9-height
9-height
 
 
README.md
README.md
 
 
binary_tree_print.c
binary_tree_print.c
 
 
binary_trees.h
binary_trees.h
 
 

Repository files navigation

0x1D. C - Binary trees

Group project Algorithm Data structure

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages