Skip to content
BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

30 Commits
0-binary_tree_node.c
0-binary_tree_node.c
 
 
0-main.c
0-main.c
 
 
0-node
0-node
 
 
1-binary_tree_insert_left.c
1-binary_tree_insert_left.c
 
 
1-left
1-left
 
 
1-main.c
1-main.c
 
 
10-binary_tree_depth.c
10-binary_tree_depth.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
 
 
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
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.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
 
 
13-binary_tree_nodes.c
13-binary_tree_nodes.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.
134-heap_to_sorted_array.
 
 
14-binary_tree_balance.c
14-binary_tree_balance.c
 
 
15-binary_tree_is_full.c
15-binary_tree_is_full.c
 
 
16-binary_tree_is_perfect.c
16-binary_tree_is_perfect.c
 
 
17-binary_tree_sibling.c
17-binary_tree_sibling.c
 
 
18-binary_tree_uncle.c
18-binary_tree_uncle.c
 
 
2-binary_tree_insert_right.c
2-binary_tree_insert_right.c
 
 
2-main.c
2-main.c
 
 
2-right
2-right
 
 
3-binary_tree_delete.c
3-binary_tree_delete.c
 
 
3-del
3-del
 
 
3-main.c
3-main.c
 
 
4-binary_tree_is_leaf.c
4-binary_tree_is_leaf.c
 
 
4-leaf
4-leaf
 
 
4-main.c
4-main.c
 
 
5-binary_tree_is_root.c
5-binary_tree_is_root.c
 
 
6-binary_tree_preorder.c
6-binary_tree_preorder.c
 
 
6-main.c
6-main.c
 
 
6-pre
6-pre
 
 
7-binary_tree_inorder.c
7-binary_tree_inorder.c
 
 
7-in
7-in
 
 
7-main.c
7-main.c
 
 
8-binary_tree_postorder.c
8-binary_tree_postorder.c
 
 
8-main.c
8-main.c
 
 
8-post
8-post
 
 
9-binary_tree_height.c
9-binary_tree_height.c
 
 
README.md
README.md
 
 
binary_tree_print.c
binary_tree_print.c
 
 
binary_trees.h
binary_trees.h
 
 

Repository files navigation

This repository focuses on binary tree and binary search tree data structre and algorithm in C programming language

About

This repository was created for the practice of another data structure 'Binary Tree'. Binary Trees are general trees in which the root node can only hold up to maximum 2 subtrees: left subtree and right subtree.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages