Skip to content
BranchesTags

Latest commit

 

History

64 Commits

Folders and files

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

In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. That is, it is a k-ary tree with k = 2.

A recursive definition using set theory is that a binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set containing the root.

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