Skip to content
/ binary_trees Public

A binary tree is a hierarchical data structure that consists of nodes connected by edges. Each node can have a maximum of two child nodes, referred to as the left child and the right child.

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

christyTam/binary_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
.0-binary_tree_node.c.swp
.0-binary_tree_node.c.swp
 
 
.1-binary_tree_insert_left.c.swp
.1-binary_tree_insert_left.c.swp
 
 
.17-main.c.swp
.17-main.c.swp
 
 
.binary_trees.h.swp
.binary_trees.h.swp
 
 
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-left
1-left
 
 
1-main.c
1-main.c
 
 
10-binary_tree_depth.c
10-binary_tree_depth.c
 
 
10-main.c
10-main.c
 
 
11-binary_tree_size.c
11-binary_tree_size.c
 
 
11-main.c
11-main.c
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
12-main.c
12-main.c
 
 
13-main.c
13-main.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-main.c
16-main.c
 
 
17-binary_tree_sibling.c
17-binary_tree_sibling.c
 
 
17-main.c
17-main.c
 
 
17-sibling
17-sibling
 
 
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

binary_trees

A binary tree is a hierarchical data structure that consists of nodes connected by edges. Each node can have a maximum of two child nodes, referred to as the left child and the right child.

About

A binary tree is a hierarchical data structure that consists of nodes connected by edges. Each node can have a maximum of two child nodes, referred to as the left child and the right child.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages