Skip to content
/ binary_trees Public

Implementing Binary Trees data structure and its respective algorithms using the C Programming language.

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

KingDavidJnr/binary_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

51 Commits

0-binary_tree_node.c

0-binary_tree_node.c

 
 

1-binary_tree_insert_left.c

1-binary_tree_insert_left.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

 
 

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

 
 

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

 
 

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

Binary Trees

A binary tree is a rooted tree that is also an ordered tree (a.k.a. plane tree) in which every node has at most two children. A rooted tree naturally imparts a notion of levels (distance from the root), thus for every node a notion of children may be defined as the nodes connected to it a level below (Wikipedia).

Learning Objectives

At the end of this project, you are expected to be able to explain to anyone, without the help of Google:

General

  • 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

Implementing Binary Trees data structure and its respective algorithms using the C Programming language.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages