Skip to content
BranchesTags

Latest commit

 

History

3 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
 
 
0-node
0-node
 
 
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
 
 
100-long_binary_trees_ancestor.c
100-long_binary_trees_ancestor.c
 
 
100-short_binary_trees_ancestor.c
100-short_binary_trees_ancestor.c
 
 
101-binary_tree_levelorder.c
101-binary_tree_levelorder.c
 
 
101-binary_tree_levelorder_recursive.c
101-binary_tree_levelorder_recursive.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
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
12-main.c
12-main.c
 
 
13-binary_tree_nodes.c
13-binary_tree_nodes.c
 
 
13-main.c
13-main.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
 
 
2-right
2-right
 
 
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
 
 
check_style
check_style
 
 
push
push
 
 

Repository files navigation

0x1D. C - Binary trees

  • In the set of projects we take a look at how binary trees work, and implement a binary tree using C.

Thing to learn:

  • What is a binary tree
  • What is the difference between a binary tree and a Binary Search Tree
  • What is the possible gain in terms of time complexity compared to linked lists
  • What are the depth, the height, the size of a binary tree
  • What are the different traversal methods to go through a binary tree
  • What is a complete, a full, a perfect, a balanced binary tree

About

A group project Binary trees Authored by Daniel Wabwile(Oleweps)

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages