Binany Sarch Tree ADT
Tree CBsT) s a binay tree which
Searh
Bnary
node the Valwes kkeys
eneny
tte eßt sustee BmalLe than the key Valne X,
BatstYee
Volues te keys the
grea tur than he key Valne X
Binany Search Tree
Enay Sarch Tee.
Constmeon
Lnsest B,S, Lo, 15, 20,18, 3
A) Tnset
l5 8 ’ ngnt subtnee
ot
dett hild Tnsert
Tnset 10
child
20
Insert 18, 3
18220
Binay Seaveh free
Operatons:
l: Trsetion
2. Seareing
3, Find in
Findmax Leat node
5. Deltin - Node with one childen
Node witth tuo cilden
Trsetwn
Fxanple 2 To insest 8, 4, l, 6, 5, #lo.
Routine tor inetion:
Soreking with
To Seareh a he Value X, Compare X
node % key Value es than tranese
to wrd lest subtree else torese townls
Subtee
find C Element x, Te T)
retum Nuls
Element)
else
netun find cx Taght)
elie
netn T;
3
Findnin
To ininn elent n te tree.
find the
find niun (Tvee T)
if CT ’dett
vetum T;
else
Aetun find nun CTlett)
3
Find wax
To ind the maxinm element Lm e Tree
tind max (Tnee T)
it CT z N)
vetum Nwl
vetu T
else
etum
gindmar Tigat);
Deletion
Cose
l. heat node
2. Node
One clhild
2. Node
ith dwo chidens
L het Node to be detd
To delitg
2. Node wi th One child
Node 2 hildhen
Exanple l :
|. Min ele
in
Subtree
2. Replace niinele
Exonple 2 :
15) Deltu 36
( Min Ele-35
25
Pinal Soutun
(25)
