Skip to content
BranchesTags

Latest commit

 

History

52 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
 
 
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-main.c
100-main.c
 
 
101-binary_tree_levelorder.c
101-binary_tree_levelorder.c
 
 
101-main.c
101-main.c
 
 
102-binary_tree_is_complete.c
102-binary_tree_is_complete.c
 
 
102-main.c
102-main.c
 
 
103-binary_tree_rotate_left.c
103-binary_tree_rotate_left.c
 
 
103-main.c
103-main.c
 
 
104-binary_tree_rotate_right.c
104-binary_tree_rotate_right.c
 
 
104-main.c
104-main.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
 
 
110-main.c
110-main.c
 
 
111-bst_insert.c
111-bst_insert.c
 
 
111-main.c
111-main.c
 
 
112-array_to_bst.c
112-array_to_bst.c
 
 
112-main.c
112-main.c
 
 
113-bst_search.c
113-bst_search.c
 
 
113-main.c
113-main.c
 
 
114-bst_remove.c
114-bst_remove.c
 
 
114-main.c
114-main.c
 
 
115-O
115-O
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
12-main.c
12-main.c
 
 
120-binary_tree_is_avl.c
120-binary_tree_is_avl.c
 
 
120-main.c
120-main.c
 
 
121-avl_insert.c
121-avl_insert.c
 
 
121-main.c
121-main.c
 
 
122-array_to_avl.c
122-array_to_avl.c
 
 
122-main.c
122-main.c
 
 
123-avl_remove.c
123-avl_remove.c
 
 
123-main.c
123-main.c
 
 
124-main.c
124-main.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
 
 
13-main.c
13-main.c
 
 
130-binary_tree_is_heap.c
130-binary_tree_is_heap.c
 
 
130-main.c
130-main.c
 
 
131-heap_insert.c
131-heap_insert.c
 
 
131-main.c
131-main.c
 
 
132-array_to_heap.c
132-array_to_heap.c
 
 
132-main.c
132-main.c
 
 
133-heap_extract.c
133-heap_extract.c
 
 
133-main.c
133-main.c
 
 
134-heap_to_sorted_array.c
134-heap_to_sorted_array.c
 
 
134-main.c
134-main.c
 
 
135-O
135-O
 
 
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
 
 
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

C - Binary Trees Playground

Welcome!

Welcome to the fascinating world of Binary Trees in C! 🌳 This readme is your guide to understanding, implementing, and mastering the art of binary trees.

General Objectives

What is a Binary Tree?

A binary tree is like a family tree for data, where each member (node) can have at most two children. Think of it as a branching structure, with data flowing down from parent to child.

Binary Tree vs Binary Search Tree

A Binary Search Tree (BST) is like a wise librarian arranging books on shelves. Each book has a unique position, making searching and organizing a breeze compared to a regular binary tree.

Time Complexity Wins!

Imagine a library where finding a book takes less time than reading the entire collection. That's the beauty of binary trees; they can significantly speed up operations like search, insert, and delete compared to linked lists.

Tree Metrics: Depth, Height, and Size

  • Depth: How many generations deep a node is in the tree.
  • Height: The length of the longest path from a node to a leaf.
  • Size: The total number of nodes in the tree.

Traversal Magic

Traverse a binary tree like a forest ranger exploring the woods:

  • In-order: Wander left, discover the root, explore right.
  • Pre-order: Start at the root, then venture left and right.
  • Post-order: Roam left and right before reaching the root.

Types of Binary Trees

  • Complete: Picture a seating arrangement in a theater. Every seat in the last row is filled from left to right.
  • Full: A binary tree where each node is either a leaf or has two children. It's like a puzzle; each piece fits perfectly.
  • Perfect: The holy grail of balance. All leaf nodes are at the same level, creating a symmetrical masterpiece.
  • Balanced: A tree where no branch feels heavier than the other, ensuring efficient operations.

Basic Binary Tree Structure

struct binary_tree_s
{
    int n;
    struct binary_tree_s *parent;
    struct binary_tree_s *left;
    struct binary_tree_s *right;
};

typedef struct binary_tree_s binary_tree_t;

Binary Search Tree
typedef struct binary_tree_s bst_t;

AVL Tree
typedef struct binary_tree_s avl_t;

Max Binary Heap
typedef struct binary_tree_s heap_t;

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages