Skip to content

Bakugo90/binary_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
0-binary_tree_node.c
0-binary_tree_node.c
 
 
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-ancestor
100-ancestor
 
 
100-binary_trees_ancestor.c
100-binary_trees_ancestor.c
 
 
100-main.c
100-main.c
 
 
101-binary_tree_levelorder.c
101-binary_tree_levelorder.c
 
 
101-lvl
101-lvl
 
 
101-main.c
101-main.c
 
 
102-binary_tree_is_complete.c
102-binary_tree_is_complete.c
 
 
102-main.c
102-main.c
 
 
103-binary_tree_rotate_left.c
103-binary_tree_rotate_left.c
 
 
103-main.c
103-main.c
 
 
103-rotl
103-rotl
 
 
104-binary_tree_rotate_right.c
104-binary_tree_rotate_right.c
 
 
104-main.c
104-main.c
 
 
11-binary_tree_size.c
11-binary_tree_size.c
 
 
110-binary_tree_is_bst.c
110-binary_tree_is_bst.c
 
 
110-main.c
110-main.c
 
 
111-bst_insert.c
111-bst_insert.c
 
 
111-main.c
111-main.c
 
 
112-array_to_bst.c
112-array_to_bst.c
 
 
112-main.c
112-main.c
 
 
113-bst_search.c
113-bst_search.c
 
 
113-main.c
113-main.c
 
 
114-bst_remove.c
114-bst_remove.c
 
 
114-main.c
114-main.c
 
 
115-O
115-O
 
 
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
 
 
125-O
125-O
 
 
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.c
134-heap_to_sorted_array.c
 
 
135-O
135-O
 
 
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-full
15-full
 
 
15-main.c
15-main.c
 
 
16-binary_tree_is_perfect.c
16-binary_tree_is_perfect.c
 
 
16-main.c
16-main.c
 
 
16-perfect
16-perfect
 
 
17-binary_tree_sibling.c
17-binary_tree_sibling.c
 
 
18-binary_tree_uncle.c
18-binary_tree_uncle.c
 
 
18-main.c
18-main.c
 
 
18-uncle
18-uncle
 
 
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
 
 
4-binary_tree_is_leaf.c
4-binary_tree_is_leaf.c
 
 
5-binary_tree_is_root.c
5-binary_tree_is_root.c
 
 
6-binary_tree_preorder.c
6-binary_tree_preorder.c
 
 
7-binary_tree_inorder.c
7-binary_tree_inorder.c
 
 
8-binary_tree_postorder.c
8-binary_tree_postorder.c
 
 
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

C - Binary trees

This was a partner project in which we learned about the details, advantages, and disadvantages of using trees as data structures. We learned about how to qualify trees as well as how to traverse them. Throughout the project, we implemented binary, binary search, AVL, and Max Binary Heap trees.

About

Binary trees Data Stuctures and Algorithmes

Topics

c algorithms data-structures binary-tree

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages