Skip to content
/ binary_trees Public

A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent.

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

skyino7/binary_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

56 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
 
 
10-depth
10-depth
 
 
10-main.c
10-main.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-complete
102-complete
 
 
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
 
 
104-rotr
104-rotr
 
 
11-binary_tree_size.c
11-binary_tree_size.c
 
 
11-main.c
11-main.c
 
 
11-size
11-size
 
 
110-binary_tree_is_bst.c
110-binary_tree_is_bst.c
 
 
110-is_bst
110-is_bst
 
 
110-main.c
110-main.c
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
12-leaves
12-leaves
 
 
12-main.c
12-main.c
 
 
13-binary_tree_nodes.c
13-binary_tree_nodes.c
 
 
13-main.c
13-main.c
 
 
13-nodes
13-nodes
 
 
14-balance
14-balance
 
 
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
 
 
17-main.c
17-main.c
 
 
17-sibling
17-sibling
 
 
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-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
 
 
5-main.c
5-main.c
 
 
5-root
5-root
 
 
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
 
 
9-height
9-height
 
 
9-main.c
9-main.c
 
 
AUTHORS
AUTHORS
 
 
README.md
README.md
 
 
binary_tree_print.c
binary_tree_print.c
 
 
binary_trees.h
binary_trees.h
 
 

Repository files navigation

C - Binary trees

A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node.

About

A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages