uctures

What

if and
the
It input So,
and
Here Named input
a is Algorithms
Factor left In assures obscrved
nccd
1f 'appoars
the the we after to
isBafanced see arises binary
ce second
missing, that their
that that
the non-incmas
tree, the inventor BST'S search
so difference AVL
in - is it first
the Worst-case
the height 0, tree og trec
left Adelson, Trees
ght and
subtrec is is anne comes
utree) the balanced not
of Not
difference balanced pcrformance
A more
leff of isting
Velski BST ina
and C and than
has & it sorted
input
ight is2 the Landis,
height 1. is
essutree! nest This closest "appoars ascendingordescending
height again
2 two
difference AVL 7
AVL and
trees to in
is the trees non-decroasing
linear manner
ore trece
rightbaiancodNot arc
permits isare
han subtree not called scarch
B heipht
1, balanced
the difference thc algorithms,
has balancing
tree Balance mnanner?
hcight
is
cdancefactor
binary
Facto
that
so0,
It
the is wil
ing scarch On
difference then
e
In
to
be treereal-time look
n only is
AVL like
2,
In data, this
https://www.tutorialspoint.com/cgi-bin/printpagecgi
tree
s the
third checks we -
cannot
tree,
the
the height predict
ripht
of data
subtree the
left
pattern
of and
A and
has the
height2 right
their
freguencies
sub-trees
and
the
 AVI If
Rotation
Right In Rght
unbn Rotation
Ifa Left simple The Rotations
ToAVL BalanceFactor
the height
tree our rotation
rotation
Right Left "
" balance
tree first diference
example. rotation
tree,Right-Left
Lelt-Kight
rotation
may becomes two itself,
ancedtreo let's
become rotations in
node understand an the
unbalanced, AVL
A
are
height
alanced, has tree
(left-sutree)-
(right-sutree)
height
become themsingle may of
when left
Rotatcn
Lett rotations
one
ifa
perform and
unbalanced a by
B node right
node one and
is the
s inserted the
sub-trees
inserted following
as next
a
node into is
in twO
four more
the is the rotations
left inserted right kinds than
Baancecd
subtree
subtree are of 1,
in rotations the
the double
of tree
the right of
the is
left subtree rotations. balanced
right
subtree.
of subtree,
A's To using
The have
right then
tree some
subtree. an
then we unbalanced
perform rotation
needs
We
a perform a techniques
right single tree,
rotation the we
left at
left rotation least
rotation
need
by a
tree
making
of
height
A
the
lef-subtree
2.
With
this
of
 ctures
uroaancedLeTrt oe
rotationLeft-Right As and
DoublRotation
e depicted
rotations
Let's Algorithms
the
first unbalanced
are
checksightly
State
how node AVL
complex Rotat
Rgt on A
to
perform becomes Trees
version
Left-Right the
of right
already
cause rotation child
We node A
Node first explaincd of
AVL
has its BuancedTreg
C perform A
is tree been left-right left B
still versions child
to
inserted
unbalanced, the perforn
left rotation by
rotation into of perfoning
left-right rotations
however the isa
on right combination
the rotation. To a
now, subtree right
left understand
it subtree rotation
is of of
because the left them
of left
C. Action rotation
of subtree. better,
the This htps://www.tutorialspoit.com/cgi-bin'printpage.cgi
eft-subtree makes followed we
This
should
A. makes
the by
of right take
the left Can
lett-subtree subtree rotation note
unbalanced of
of each
B
action
node
performed
These

scenarios
while
 node of ths suoree C now becomes the right suhtree afte
We shall now richt-rotate the trec, making B the new root
own left subtree

The tree is now balanced

Right-Left Rotation
followed by left rotation,
Rotation. It is a combination of right rotation
The second type of double rotntion is Right-Left
Action
State

A, an unbalanced node with balance

Anode has been inserted into the left subtrce of the right subtree This makes
factor 2.

First, we perform the right rotation along Cnode, making Cthe right subtree of its own left subtree B. Now, I
becomes the right subtree of A
res and Algorithms AVL Trees htps://www.tutorialspoint.com/cgi-bin'printpage.cgi

Node Ais stillunbalanced because of the right subtree of its right subtree and requires aleft rotation.

Aleft rotation is performed by making Bthe new root node of the subtree. A becomes the left subtree of its right
subtree B.

The tree is now balanced.

A
 Data Structure & Algorithms - Spanning Tree
Advertisements

enganaet OSRM

O Previous Page Next Page o

Asoanning tree lis a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, aspanning
tree does not have cycles and it cannot be disconnected.
By this deinition, we can draw a conciusion that every connected and undirected GraphG has at least one spanning tree. A
disconnected graph does not have any spanning tree, as it cannot be spanned to all its vertices

Graph G

Spanning Trees

We foun ree spanning trees off one complete graph. A complete undirected graph can have maximum n2 number of spanning
of
trees,,where nnis the number nodes.
where In the above addressed example, 3-2=3 spanning trees are possible.

General Properties of Spanning Tree

are a few properties of the spanning tree
We now understand that one graph can have more than one spanning tree. Following
connected to graphG

Aconnected graph G can have more than one spanning tree.

and vertices.
All possible spanning trees of graph G, have the same number of edges
The spanning tree does not have any cycie (loops).
the spanning tree is minimally connected.
Removing one edge from the spanning tree will make the graph disconnected, Le.
Adding one edge to the spanning tree will create a circuit or loop, I.e. the spanning tree is maximally acyclic.

Mathematical Properties of Spanning Tree

Spanning tree has n-1 edges, where n is the number of nodes (vertices).
 Algorituis pammg I1ee
htps://www.tutorialspoint.com'data_ structures_ algorithms/'spanning...
Erom a complete graph, byremoving maximum e- n + 1 edqes, we can construct a
spanning tree.
Acomplete graph can have maximum n number of
spanning trees.
ThUS, We can conclude that spanning trees are a subset of connected Graph G and disconnected graphs do not have spanning ree.

Application of Spanning Tree

Spanning tree is bas0cally used to find a minimum path to connect all nodes in a graph. Common application of spanning trees are -
Civil Network Planning

Computer Network Routing Protocol

Cluster Analysis
lines in
Let us understand this through a small example. Consider, city network as a huge graph and now plans to deploy telephone
Such a way that in minimum lines we can connect to all city nodes. This is where the spanning tree comes into picture.

Minimum Spanning Tree (MST)

than all other spanning trees of the same
In a weighted graph, a minimum spanning tree is a spanning tree that has minimum weight
load or any arbitrary value denoted to the
graph. In real-world situations, this weight can be measured as distance, congestion, traffic
edges.

Minimum Spanning-Tree Algorithm

-
We shall learn about two most important spanning tree algorithms here
Kruskal's Algorithm

Prim's Algorithm

Both are greedy algorith ms.

O Previous Page Next Page O

Advertisements