AE

Name enlali yadav

BranchComputez Enqineeaing
RolNo-58 Tt
Assiqoment NO+2

ns A bi KYEXee ig a hiesasChiat dataa stUCuae i Ct

o c h each aode has a t onost tuDO childden agedn
epeaOed a s ept child and aiarrtchi
acn'nade LOtatiS a CoaponertlS:
C
pointex ta lept Companents
pointes to miant SoloAnee
3Datc elements:
he Dpmost node 9 t h e 3 t a Catied dhe too
n empy *ree is. epmesentec b NULLpointe
A e p e sendation op binaau ree ia houon
ept Data Riqht
A

upes o 1na yiree9

CRoot inay tree I t has c ovot aode and eLt C
nede aD ol moot
cildren hoo
U 1 bino re e s aree
in du e e hos iele O 2 h i [d Te ien
 i n a y de e
Tuo numbe 0 nodes,n, in_o b
n e 2 h d - 1 on Me
otleo94 n : o h - ,and amo t

leo nodes , in afs h irey dree

C no:
+1,e ,
Dpindemal nodes
19no:
Cu)Peeot biAaY Tee
nodes
bnasy +ee in usnih ol indezi os
Tt t9 a

cildich ondall leae ho 9 Cim0

ho9 2
leno

O h {ea es
dree leHt
)A_peert biay
2 D nodes
ha e2h, and
nee i
Tn1Depec d puil binay
nodes b is
n: 2hAl-1, o h e n n i s no: oP
height Opyees n d d is n o o p leap nodes

Cu) Complete binany ree letnel,except.

1 9 C bino e n OWch euir
completely pile Cndall nsks
(osstbly Ane la)4,
CAe au9 p a h e iept as
possibte.
 PAGE No

OATE

) anced iuay dree

Abioy dee s eict bolanmced ip id dlicg
tlu folloui Couio Ardi{S
COTUe leyeu iMt sulbireesno
LMOS+ o NA) difev by
tu) Tu leg guLbree is
Ct Te helanced AND. ,
9undcee 19 alanced
n emby imae i
Abeanced.
 A

naTE

V) Dege naarct deO

Tt i a dree is ndre eoLt1DgMends node
a d nad e: e la s lin&e
ea

inked t

EXpleuin dippevenA goph ranuesa ec hni

destails
ulucet
Tn dtais Sertion e utl Cee
nd tle dncun1ensal lgooidiam opi
nades o A N l e t Y ConnLced

ede Ule edaes mu be imteoT

o0 C t v , f T e
s tupCak be repme,geuf t d
otleuing pn CoLL be MLpe Send faL
CnCa,b,k,2eLCA,B), Ce,D), (D,E).CC),cA)