Binary Search

General Trees:Are unordered tree data structures where the root node has minimum 0 or maximum ‘n’ subtrees.
Binary Trees: are general trees where node can hold max. of 2 subtrees. They are of 3 types
- Full Binary Tree: A full binary tree is a binary tree type where every node has either 0 or 2 child nodes.
- Complete Binary Tree: A complete binary tree is a binary tree type where all the leaf nodes must be on the same level.
- Perfect Binary Tree: a binary tree type where all the leaf nodes are on the same level and every node except leaf nodes have 2 children.
Binary Search Trees: Works exactly as binary trees but with constraints. values in the left subtree are always less than the values in the root node and the values in the right subtree are always greater than the values in the root node.

Although the arrangement in BST has advantages, it leads to skewness which is can be overcame by Balance Binary Search Trees

Balanced Binary Search Tree.

if m-n = 0/1/-1 then a binary search tree becomes a Balanced Binary Search Tree. Binary Search Trees use rotations as self-balancing algorithms. There are four different types of rotations:
- Left Left
- Right Right
- Left Right
- Right Left.

They ensure that the height difference between the left and right subtrees (the balance factor) of any node is at most 1. This guarantees that the tree remains balanced, and operations have a logarithmic time complexity

They ensure that the tree remains approximately balanced by enforcing certain rules and are more flexible than AVL trees in terms of balancing.

They are typically used in database systems and file systems. They are not binary trees but are self-balancing tree structures that generalize binary search trees.

They are self-adjusting binary search tree. They reorganize themselves during operations to move recently accessed items closer to the root.

Priority Search Trees are a type of self-balancing tree used for various applications, including range queries and geometric algorithms.

Name		Name	Last commit message	Last commit date
Latest commit History 38 Commits
0-binary_tree_node.c		0-binary_tree_node.c
1-binary_tree_insert_left.c		1-binary_tree_insert_left.c
10-binary_tree_depth.c		10-binary_tree_depth.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
3-binary_tree_delete.c		3-binary_tree_delete.c
4-binary_tree_is_leaf.c		4-binary_tree_is_leaf.c
5-binary_tree_is_root.c		5-binary_tree_is_root.c
6-binary_tree_preorder.c		6-binary_tree_preorder.c
7-binary_tree_inorder.c		7-binary_tree_inorder.c
8-binary_tree_postorder.c		8-binary_tree_postorder.c
9-binary_tree_height.c		9-binary_tree_height.c
README.md		README.md
binary_trees.h		binary_trees.h