Skip to content

amiresaye6/binary_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

41 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
 
 
111-bst_insert
111-bst_insert
 
 
111-bst_insert.c
111-bst_insert.c
 
 
111-main.c
111-main.c
 
 
112-array_to_bst.c
112-array_to_bst.c
 
 
115-O
115-O
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
12-leaves
12-leaves
 
 
12-main.c
12-main.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
 
 
13-main.c
13-main.c
 
 
13-nodes
13-nodes
 
 
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-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
 
 
18-uncle
18-uncle
 
 
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
 
 
README.md
README.md
 
 
binary_tree_print.c
binary_tree_print.c
 
 
binary_trees.h
binary_trees.h
 
 
go_live.sh
go_live.sh
 
 

Repository files navigation

Binary Tree Basics 🌳

This repository provides information and code related to binary trees.

Table of Contents 📚

What is a Binary Tree? 🌱

A binary tree is a data structure consisting of nodes, where each node has at most two children referred to as the left child and the right child. These children are usually known as the left subtree and right subtree, respectively.

Difference between Binary Tree and Binary Search Tree 🌲

While both are binary trees, a Binary Search Tree (BST) has an additional property. In a BST, the left subtree contains nodes with values less than the parent node, and the right subtree contains nodes with values greater than the parent node.

Time Complexity Gain compared to Linked Lists ⏰

Binary trees can offer significant improvements in terms of time complexity over linked lists for certain operations. For example, searching, inserting, and deleting elements in a balanced binary search tree can be performed in O(log n) time, whereas in a linked list, these operations typically take O(n) time.

Depth, Height, and Size of a Binary Tree 📏
  • Depth: The depth of a node is the number of edges on the path from the root node to that particular node.
  • Height: The height of a tree is the maximum depth of any node in the tree.
  • Size: The size of a tree is the total number of nodes in the tree.
Traversal Methods for Binary Trees 🚶‍♂️

There are several ways to traverse a binary tree:

  • Inorder Traversal
  • Preorder Traversal
  • Postorder Traversal
  • Level Order Traversal
Types of Binary Trees 🌿

Complete Binary Tree 🌐

A binary tree is considered complete if all levels of the tree are completely filled except possibly for the last level, which is filled from left to right.

Full Binary Tree 🌳

A binary tree is considered full if every node has either 0 or 2 children.

Perfect Binary Tree 🌲

A binary tree is considered perfect if all of its levels are completely filled.

Balanced Binary Tree ⚖️

A binary tree is considered balanced if the height of the left and right subtrees of every node differ by at most one.

Example Tree Structure 🌱

           1
         /   \
        2     3
       / \   / \
      4   5 6   7
     / \       / \
    8   9     10  11
   / \   \       / \
  12  13  14    15  16

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages