Professional Documents
Culture Documents
GeeksQuiz
Home
Algorithms
DS
GATE
Interview Corner
Q&A
C
C++
Java
Books
Contribute
Ask a Q
About
Array
Bit Magic
C/C++
Articles
GFacts
Linked List
MCQ
Misc
Output
String
Tree
Graph
Insertion
To make sure that the given tree remains AVL after every insertion, we
must augment the standard BST insert operation to perform some
re-balancing. Following are two basic operations that can be performed
to re-balance a BST without violating the BST property (keys(left) <
key(root) < keys(right)).
1) Left Rotation
2) Right Rotation
T1, T2 and T3 are subtrees of the tree rooted with y (on left side)
or x (on right side)
y x
/ \ Right Rotation / \
x T3 > T1 y
/ \ < - - - - - - - / \
T1 T2 Left Rotation T2 T3
Keys in both of the above trees follow the following order
keys(T1) < key(x) < keys(T2) < key(y) < keys(T3)
So BST property is not violated anywhere.
C implementation
Following is the C implementation for AVL Tree Insertion. The following C
implementation uses the recursive BST insert to insert a new node. In the
recursive BST insert, after insertion, we get pointers to all ancestors one
by one in bottom up manner. So we dont need parent pointer to travel
up. The recursive code itself travels up and visits all the ancestors of the
newly inserted node.
1) Perform the normal BST insertion.
2) The current node must be one of the ancestors of the newly inserted
node. Update the height of the current node.
3) Get the balance factor (left subtree height right subtree height) of
the current node.
4) If balance factor is greater than 1, then the current node is
unbalanced and we are either in Left Left case or left Right case. To check
whether it is left left case or not, compare the newly inserted key with the
key in left subtree root.
5) If balance factor is less than -1, then the current node is unbalanced
and we are either in Right Right case or Right Left case. To check whether
it is Right Right case or not, compare the newly inserted key with the key
in right subtree root.
#include<stdio.h>
#include<stdlib.h>
// Perform rotation
x->right = y;
y->left = T2;
// Update heights
y->height = max(height(y->left), height(y->right))+1;
x->height = max(height(x->left), height(x->right))+1;
// Return new root
r e t u r n x;
}
// Perform rotation
y->left = x;
x->right = T2;
// Update heights
x->height = max(height(x->left), height(x->right))+1;
y->height = max(height(y->left), height(y->right))+1;
r e t u r n 0;
}
Output:
Pre order traversal of the constructed AVL tree is
30 20 10 25 40 50
Time Complexity: The rotation operations (left and right rotate) take
constant time as only few pointers are being changed there. Updating the
height and getting the balance factor also take constant time. So the
time complexity of AVL insert remains same as BST insert which is O(h)
where h is height of the tree. Since AVL tree is balanced, the height is
O(Logn). So time complexity of AVL insert is O(Logn).
The AVL tree and other self balancing search trees like Red Black are
useful to get all basic operations done in O(Logn) time. The AVL trees are
more balanced compared to Red Black Trees, but they may cause more
rotations during insertion and deletion. So if your application involves
many frequent insertions and deletions, then Red Black trees should be
preferred. And if the insertions and deletions are less frequent and
search is more frequent operation, then AVL tree should be preferred
over Red Black Tree.
Following are some previous posts that have used self-balancing search
trees.
References:
IITD Video Lecture on AVL Tree Introduction
IITD Video Lecture on AVL Tree Insertion and Deletion
Given a binary tree, how do you remove all the half nodes?
Kth Largest Element in BST when modication to BST is not
allowed
Vertex Cover Problem | Set 2 (Dynamic Programming Solution for
Tree)
Check whether a binary tree is a complete tree or not | Set 2
(Recursive Solution)
Check whether a binary tree is a full binary tree or not
Find sum of all left leaves in a given Binary Tree
Remove nodes on root to leaf paths of length < K
Find the closest leaf in a Binary Tree
Like 33 Tweet 2 6
Writing code in comment? Please use ideone.com and share the link
here.
Interview Experiences
Advanced Data Structures
Dynamic Programming
Greedy Algorithms
Backtracking
Pattern Searching
Divide & Conquer
Mathematical Algorithms
Recursion
Geometric Algorithms
Popular Posts
All permutations of a given string
Memory Layout of C Programs
Understanding extern keyword in C
Median of two sorted arrays
Tree traversal without recursion and without stack!
Structure Member Alignment, Padding and Data Packing
Intersection point of two Linked Lists
Lowest Common Ancestor in a BST.
Check if a binary tree is BST or not
Sorted Linked List to Balanced BST
Siya
common man
Given an array A[] and a number x, check for pair in A[] with
sum as x 39 minutes ago
Cherish_
Muddukrishnamurthy Venkatesh
nice info
venkat