baydre / binary_trees Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This repository contains code and algorithms for working with binary trees, including creation, traversal, and various tree operations. It serves as a resource for learning and implementing binary tree data structures in C programming language which could be adapted to any language of choice.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 49 Commits
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-main.c		1-main.c
10-binary_tree_depth.c		10-binary_tree_depth.c
100-binary_trees_ancestor.c		100-binary_trees_ancestor.c
100-main.c		100-main.c
11-binary_tree_size.c		11-binary_tree_size.c
12-binary_tree_leaves.c		12-binary_tree_leaves.c
13-binary_tree_nodes.c		13-binary_tree_nodes.c
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
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
AUTHORS		AUTHORS
README.md		README.md
binary_tree_print.c		binary_tree_print.c
binary_trees.h		binary_trees.h

Repository files navigation

The Binary Tree

Description

This project is a collection of functions that work with binary trees. It covers various operations on binary trees, including node insertion, traversal methods, height measurement, and more.