0% found this document useful (0 votes)
68 views20 pagesDSA-Unit4 Handwritten Notes
The document discusses various data structures, particularly focusing on B-trees and red-black trees, highlighting their properties and operations. It explains the importance of balancing in these trees and introduces splay trees as a self-adjusting structure that optimizes access times. The text also touches on applications of these trees in different systems, emphasizing their efficiency in searching and maintaining data.
Uploaded by
qwertyuiop6851Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
68 views20 pagesDSA-Unit4 Handwritten Notes
The document discusses various data structures, particularly focusing on B-trees and red-black trees, highlighting their properties and operations. It explains the importance of balancing in these trees and introduces splay trees as a self-adjusting structure that optimizes access times. The text also touches on applications of these trees in different systems, emphasizing their efficiency in searching and maintaining data.
Uploaded by
qwertyuiop6851Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 20
Beals Bled —-tas8 = parry of clewends OF - :
dimension wn Vo
| T Siwple _iveplemenabicn of not the yde may wag
= Fore sig Seguentied aa _struchimes such ag |
+ enrvetys “do | Lold “He keys Curd fre printers _ fared
_cluel _ool28 teen
= Thus a R-tree cf omdea ppewe ecb
oh _jeix med) +> be. apres using og
00 YS Farm rouse esa cag ee
+ corexes pondlir tb the clild poy ters coud _k _
__-wegpech /__cauge was s pace
: ok cian ees
ed ee S_ Fey demands
___-soquerti ally searchin, fen tre efewerd in pre
04:29. 40 dlederrmire. He Clit pointes of
abe. i Oe ee olowr)
the dre ,_befirse it _evertuially eepabeg Hoe key — a
_ots_ivsent SOY, as -Hre case — roy be! .
- EF the dex of the B tree js —_Srnalt, =
"then ox —efechve._solthon _cnoutld be to ae .
"the leeys of each of the nodes in he |
Baty _O-8_¢ seen Ss pala execs ot ©
— However it reeds tbe ensured trad tre
loranehed linking 4he__yedes of -the binaty
seach jxee “Ove. distinguished Bon te
Some inking fe model! of se B-tree
With regard Vin Brees of exdex 4 also,
neAS TE referred te _a3_2-4 tare ay
-3-4& drsces , 4 _an__be_shown tek _a __
oY searth free p sepresedtadion of” _eoal,
—of its nedes, yields a concep Wed _-feoenp
- =Consider tne 2-4 free shown in fy below —_ =
the basis -By___a._special Kid ef __biraty
—cemth tree cated yed-blook twee __ =
— [le] 70
— A bine search te. “representa cn ot cord: ote
phe nodes is as fallow? — =
E = Herein line indicates — _pranches wlich line
(re nolo fhe —bineary —searcl tae — and
_ atck [ines ee .
= ot_+ve ciginal 6 taree : ee
= Non “i “te thin tines ard Hae __nnodo8 :
= “Ne ee paded light Cred)
— CutcK fine? ane) tre nodes beng tag ——
Bara them were Shaded) poy (black), 7
she rweouttt. vA toee > be a8 shnwn
ee Note fat pre wert ede 45 autnays shaded
piace. Such 0 pee is caod- paler a ae
_____aregl black tree
Defi nthea
A yed=blacle 4ree—is—_om. Pentend ef binecty el
__sexrth sxe im —which_the__ned!-23_o eda 29,
: —_ hettren ashi tere red 22 _emerote a
either aed) om _blacle ans | sottisly. en
: ns ey —propeaties — a “a6
CD
: Oh Tye nent wed. aind toe exdernal ned 28 ain
lays black mode $ a
ia BY Pol Canister wo has red nedes cau occua-
~—_censeeufively on _4he_ path -Prema_the sce
ede to_an_extemal mode»
2) Black condition the neemberr of black. nodes
2 te perth Pare ne seat _nede dts
—__ Om externdd mode rvnust be _ the sme,
irc _allt__externed__ nade, —_____-
“= The_namber of black redes_ov_edyeo_ en tbe
—_ a x rode to an external node is _
ented the rank of the rede. The rank oF
—etl_externel nedeg-js "or
— eapite — Slain ner ereuaple_ of ro
An 2x: oes
Ae
Red) -bihele Tee SB
= Observe Hire above daee to pe com— extended
~~ loi vote gent tree with jis wrest — curd exterrel
oyada ty be black) eee
The_ved comdition where ro ho consewcud ye
—_xed_nodes. ‘cup occur _is_satisfi2
7 A yoy rd en aol
——— paths fevent_tae “aot to Hae _extermef
ato bh, e ee —
ATs the btack comelihin whewe cee _aao~te-
- extexnal _nede pats mush —aenteda He
__sowe numberr of" block nod23 Is alse
| tre. — — :
|= Every _—s ach path inthe giver tree _contalns
2 xackly a black nodes. = -
a sestbiny a wedl-black tree
DB -roertvg ade _jntn _o-wed-blach too
: — Penn ocred blak tree
ane_ove some epee Half Radcblack free
| pels Co mole j
| Bites, od ts 1 balamee sotab‘ens A Bepesabatien of to “£o_Red-hlac -bioclo
since «& re xed pee prctendad binaty
eooth tree, the [ive ef node rePresertat cr
Usest_-Far- a bin sent, ee _ mos _ PO
exployasl for Abe sree. as cell |
= Heneversince_the_caln=_o_a_rode— plays.
a _domiyunt apie im thre deRnition of He 7
___ed -black tree jis easenbjed Head Hee
pee ee a ee ee
os £eld (CoLo ou) Another scheme .
_ ae aecerd the colar et the —
Pane the nade
a a ai ite otter) a fem
—Tnhalonee a aed-bltk tear ee cing
AR fe tree nay call For waving cap
| ond down the tree clacing Ha
cacliustment®. Ta — mee
sencvermernd- the nocl 2 struchire
xed=blade tree ney we a
£
~
nodes .
| pasa ede teh thee arespective
7 Tapic- splay Trees — ee
ee
= Pssame a cose where oa x0 cords -
: ot
| s-skscad os a bivscey Se earch ree , ~
Now TF aw record
| whe ty ——
| «cco Sed LCon tes), He then mm the hone a —
: 7 eo
fox a PARENT frelol PARENT Hold 7: complexity ef the _opersetion sequence exacdal
be Om) js the coowsh_ case.
= Whol if these wore to be a late stouctur®,
which, once _js__likely to. getoccesset nee
— arb fen em ene hots jE teewe were o fo be
———o_data_struchre, which emnee—r mode is
accessed radicatty changed in shofe 1 path
the accessed nede os Ye ret)
oc The asliast wert _-Hrmcegda _ 2x pensive the Poste
Hime aun _occe8S fin ca nde is nsd 2,
— -Con_make the _crepeatool access ty ve
Se, hogy ee eee
= Also, _duciva jhe _proce9S ef? _ adjust: Se
= where the odes owe yewoved —_ ancnurd
4O_make 7am for Hee yrasle new rede, _
the ether moder dhe are clover
Aeno4y wade aaki na ther egso3
ee na ie as. wail ACIS
= Splay trees ove ‘sua dats strachores -
pect this mechouism, These aan
loinsty search treed with a self gdiuttng
mecha which renders them vn
___— ef ici2v aver _a _sequemee of
Nodes hich aaa" feepaccdiy cease 7
__-—raves!_pworrls_the_sent there hy
___—trendenig ftrtherr retrieves of ne ean
S —
to be efciewh oe
Bate ced) ee Ones ey
i: eine. fer seach. a ingeehioy toe ny
a a paeel trwta te
This_eoadel ols ledge otter nodel to a
eee eae, seat ond in -
conse ef Sime comdd howe fre
tly ecceSsod gre @)
jnachve. nodl 29 movirg farther anal fatter
away Areva the xeadt, ———__________——
~~ The_'spley tree i remain -Palesine Unbalanced)
= — The splay treeg are, meve cheapen they
AVL 4-vee2, by. oop of fhe # nub er ee
— —epeaations., Sugh crm ermal: gis olich
—... spreads_over g sequewe’ of operator _
- axel im which dhe expensive. openesiens are
_. -etvernagea) over the lees expensive ones —
6 bat kt ott a iz0ok cunrabysic .
Se fee Fime_coenpteny PL _ oa singe access
— tira ara On), ren Hae amarhizeo
— qnalyais CF the aceag jy a_< ye ol
aa Sequence of 70 atectnea :
1s_ OC. togn’) jo
F Spley Rotakions — aa =
_=An_insest or search operchen_ on. a_spley tree, :
—— proceeds as ome wold cn_a binaty — Searcl, /
“Pree. Haweverr,_at her jhe opesatien is over
the tree js splayed witn regard to_jte ”
ecific— node —___ oe
TTS coculd meont pushing the node ane
: 4 the _nodle ac
__ towards He xeat_ Tathedlicatty rae ws
whe are Known 03 Splay_ syokeKers ,
=Splefaviahen3 ove move “or leac Simi]
4p._AV dree xymtadiern? oJ proceecl bother
WP Ferm Fh2 Node tyesoxds fhe “wet ” uk — —in—Hee eH uemce =
H. a, AN, iis ia
nse (Q)—Tnsext Q
a Ce
® a OS =
—— \ Q
end A : sploy Q i
@) Inse Cea
fot ~ orloy ww
a ; ep C=
a ee {-splay-N- —~ = Applicadien? that crve. of bine sears 9028 are
of same Par ed-black 422-22.
~~ ppplistinns ploy Fee
7 aes iv ease of a university. inferred,
—_ Herd, ok te _beginni of the admissicn_
— Boose Hass. rectly opti 4a the
— cnewly —adrmif--e0/ sted entS — aore [ni tikely
| 4o_be accesses] gy@rr cwol__ovey_ gal :
| fo_are. Ast -fesa__weeles of Heirs sey:
|
7 Th_such_a cose, it would be oa
| »move__tr_ store fhe reandg oa a, sploy
| tree nether than a bingy search Agee. /
|_-=Sinc@__a__sploy tree pushed tue — recent
—_ ee ees ‘Shey cbse to yee, _
-awot_omdl in olue course those. WOCOAQ
thet were xem’ —usedl move _ —rwettee feoythen-
on Faber eg ton the amt
a oteepy _ PasitionS — olase ne the Fx}
— Se Wee ae a Pringe,
= Maintenousce of pated reals in. -
hospital ——nhinemnachen Syst may recrirtenance oy ‘
ecosds_ pertaining to seasonal [tems _
a ino
_ Supe mask et inferrmatien Syston ome. __Seme_
= Sploy—+vee3 lave “ge = Frsrd * ¥
tn_e o_comprceasien, lex ico apis eoachy
-prees aud clonic ae meg) : — 3 Tepie— = Syybod ne) Tablet — ————
i & Staudoad data stouchire. used in
[asfuoge _processivs WTrfrrahon bert vorlou8
_gante _lorguage “constructs com 2 share
——_}n_a_syyrobol_teble____—
——= Each eymbe) ccm rave list, a
—_aSsaciotesl arte? ._A- syrebol_od og “eat Hy
| the bist of assectatesl attalbuhes firms on
j—_Raetary ex? ex _gymnbool trate
Eo Symborl ptinibut03, .
- Te tea Tame. a
— ss =weJ.NO a
aL addrcas. a
(= Representation c_syrnlze]_deJale ith foe iva
Ree Fores = a
= Static tree tables oo
- —Dynawic tree tables 2
=Symbol_tabJe can _be Stored sing ov oguerdHval -
clade struchre. Sp mnbels_con be ‘sprrted! on nowe
| sopueudialtyy, A cyrbe] could be
loca ect il ust ae bonacci_ = eB
- To success ae Aommined 0s. sk_on interro|
eat gor 0, shen 9 rpercttens of the—
rile leodo is needed. Hence the _expectas{
@St-_cembvibedion Prem fhe irdeanal nocle_
——-Fir_ayis_ pCa)» level Cay)
Unsuccessful cearches terraired 23 with”
Le ed an extern! mode), The ident
——__im_the imaty s.emclh qree can be
into mt] edulvatene _classe8, F;', 0S
——=The class_€, contairs ay _jdenws Fie >
sath sheb ot