DS Unit 3
DS Unit 3
Unit-3
Advanced Trees
Binary Search Tree
● Binary Search Tree (BST) is a tree in which all the
nodes follow the below-mentioned properties −
}
Else if(temp->left!=NULL && temp->right==NULL)//only left child
{
if(parent->left==temp)
parent->left=temp->left;
else
Parent->right=temp->left;
Free(temp);C++;
Break;
}
Else if ( temp->left==NULL && temp->right!=NULL)//only right child
{
if(parent->left==temp)
Parent->left=temp->right;
Else
Parent->right=temp->right;
Free(temp);C++
Else if(temp->left!=NULL && temp->right!=NULL)//two children
{
t=temp->right;
P=NULL;
While(t->left!=NULL)
{
P=t;
t=t->left;
}
Temp->data=t->data;
If(t->right!=NULL)
{
P->left=t->right;
}
Free(t);C++;
Break;
}
Void inorder(struct node *temp)
{
If(temp!=NULL)
{
Inorder(temp->left);
Printf(“%d”,temp->data)
Inorder(temp->right);
}
AVL Tree
▪ The AVL tree was introduced in the year 1962 by G.M.
Adelson-Velsky and E.M. Landis.
▪ An AVL tree is also a binary search tree but it is a balanced tree.
▪ A binary tree is said to be balanced if, the difference between
the heights of left and right subtrees of every node in the tree is
either -1, 0 or +1.
▪ In an AVL tree, every node maintains an extra information
known as balance factor.
▪ Balance factor = heightOfLeftSubtree - heightOfRightSubtree
AVL Tree
▪ Example of AVL Tree
AVL Tree Rotations
▪ In AVL tree, after performing operations like insertion and
deletion we need to check the balance factor of every node in
the tree.
▪ If every node satisfies the balance factor condition then we
conclude the operation otherwise we must make it balanced.
▪ Whenever the tree becomes imbalanced due to any operation we
use rotation operations to make the tree balanced.
▪ Rotation operations are used to make the tree balanced.
▪ Rotation is the process of moving nodes either to left or to right
to make the tree balanced.
AVL Tree Rotations
▪ There are four rotations and they are classified into two types.
Single Left Rotation (LL Rotation)
▪ In LL Rotation, every node moves one position to left from the
current position. To understand LL Rotation, let us consider the
following insertion operation in AVL Tree...
Single Right Rotation (RR Rotation)
▪ In RR Rotation, every node moves one position to right from
the current position. To understand RR Rotation, let us consider
the following insertion operation in AVL Tree...
Left Right Rotation (LR Rotation)
▪ The LR Rotation is a sequence of single left rotation followed by a single
right rotation. In LR Rotation, at first, every node moves one position to the
left and one position to right from the current position. To understand LR
Rotation, let us consider the following insertion operation in AVL Tree...
Right Left Rotation (RL Rotation)
▪ The RL Rotation is sequence of single right rotation followed by single left
rotation. In RL Rotation, at first every node moves one position to right and
one position to left from the current position. To understand RL Rotation, let
us consider the following insertion operation in AVL Tree...
Operations on an AVL Tree
▪ The following operations are performed on AVL tree...
▪ Search
▪ Insertion
▪ Deletion
Search Operation in AVL Tree
▪ In an AVL tree, the search operation is performed with O(log n) time complexity. The
search operation in the AVL tree is similar to the search operation in a Binary search
tree. We use the following steps to search an element in AVL tree...
▪ Step 1 - Read the search element from the user.
▪ Step 2 - Compare the search element with the value of root node in the tree.
▪ Step 3 - If both are matched, then display "Given node is found!!!" and terminate the
function
▪ Step 4 - If both are not matched, then check whether search element is smaller or
larger than that node value.
▪ Step 5 - If search element is smaller, then continue the search process in left subtree.
▪ Step 6 - If search element is larger, then continue the search process in right subtree.
▪ Step 7 - Repeat the same until we find the exact element or until the search element
is compared with the leaf node.
▪ Step 8 - If we reach to the node having the value equal to the search value, then
display "Element is found" and terminate the function.
▪ Step 9 - If we reach to the leaf node and if it is also not matched with the search
Insertion Operation in AVL Tree
▪ In an AVL tree, the insertion operation is performed with O(log n) time
complexity. In AVL Tree, a new node is always inserted as a leaf node. The
insertion operation is performed as follows...
▪ Step 1 - Insert the new element into the tree using Binary Search Tree
insertion logic.
▪ Step 2 - After insertion, check the Balance Factor of every node.
▪ Step 3 - If the Balance Factor of every node is 0 or 1 or -1 then go for next
operation.
▪ Step 4 - If the Balance Factor of any node is other than 0 or 1 or -1 then
that tree is said to be imbalanced. In this case, perform suitable Rotation to
make it balanced and go for next operation.
Construct an AVL Tree by inserting numbers from 1 to 8.
Deletion Operation in AVL Tree
▪ The deletion operation in AVL Tree is similar to deletion
operation in BST.
▪ But after every deletion operation, we need to check with the
Balance Factor condition.
▪ If the tree is balanced after deletion go for next operation
otherwise perform suitable rotation to make the tree Balanced.
▪ Deleting a node from an AVL tree is similar to that in a binary
search tree. Deletion may disturb the balance factor of an AVL
tree and therefore the tree needs to be rebalanced in order to
maintain the AVLness.
Deletion Operation in AVL Tree
▪ To rebalance the tree there are two types of rotations
▪ 1.L rotation
▪ 2.R rotation
▪ If the node which is to be deleted is present in the left sub-tree
of the critical node, then L rotation needs to be applied else if,
the node which is to be deleted is present in the right sub-tree of
the critical node, the R rotation will be applied.
Deletion Operation in AVL Tree
▪ A is the critical node and B is the root node of its left sub-tree. If node
X, present in the right sub-tree of A, is to be deleted, then there can be
three different situations
▪ 1.R0 rotation (Node B has balance factor 0 )
▪ If the node B has 0 balance factor, and the balance factor of
node A disturbed upon deleting the node X, then the tree will be
rebalanced by rotating tree using R0 rotation.
1.R0 rotation
Example For R0 rotation
Delete Node 55
from the AVL tree
R-1 Rotation (Node B has balance factor -1)
▪ R-1 rotation is to be performed if the node B has balance factor -1. This case
is treated in the same way as LR rotation.
Example For R1 rotation
Deleting
the node
60
m-WAY Search Trees
▪ The m-way search trees are multi-way trees which are
generalised versions of binary trees where each node contains
multiple elements.
▪ In an m-Way tree of order m, each node contains a maximum of
m – 1 elements and m children.
▪ An m-way search tree is a m-way tree in which following
condition should be satisfied −
▪ Each node is associated with m children and m-1 key fields
▪ The keys in each node are arranged in ascending order.
▪ The keys in the first j children are less than the j-th key.
▪ The keys in the last m-j children are higher than the j-th key.
Structure of M-Way Search Tree