Computer Science | University of Colorado Boulder | …ketelsen/files/courses...Announcements (Not a Real) Homework 13 on graphs and trees posted Review Session Friday (Reading Day)

Bring ID

= = -

Tz=Tz•T,1-1

.

T,

: • Tz '

. • Tz : •/\•= =

•

• 11Ty : •/\• Ts : % Is .

•/↳ o/\o

Tuft } .Tz T5=T4.T}

For n > 3•

BASIS : Ts : 9\ 3-2=1 Ty : •/•\ " ' I 2=2- • • ✓ •/↳

RECVRIYESIP : FOR THE IH ASSUME hltn . 2) = n -4

AND h( Tn . , ) = n -3 For Fib TREES Tns & Tnt.

hltn ) = k ( Tn . ,.tn . z )

= It naax ( hc Tnt ),h( Tn . it )

= ) t raax ( n -3, U - 4) ( By

IH )= It ( n -3 )= n . z ✓

• •

•1b• £↳•IT Tz

TZ •/\••T3

hl B) =3 -2=1 hlTH)=4 -2=2

-

FHP !

=

→- -

e =

- = -

=

=

#-

a06 Convention " LARGEST

/ \ GHAR OR BLOCK GOES@ @ On LEFT

@/\@

⇐-

DO'AO

**

.

DO AO

p A

o 1

0 10 (

DAo

,

← 11

19 4 ← 10100

01 → 100

37 Zx 2× Zx

µ×⇒tTY*a

ygopits80 + 60 + 45 + '% ,at,E°→ 2 Bits

13,6 → 3 Bits

D A

=

335

Fso= 75%

IPPPA

D A 11

00 01

100 L o )

p A

←101

\@ 1011

:t

*,Qo¥''

±* EO@ SO01¥TO'&

140

85 E

1"

45 S

OlyA 15⇒TDa 0010 0011 11

140

S T A T E 85 E

= -- - ,

Of 0010 000 0010 / 45 s01

A 150100100000°101

ooo

T P

0010 0011

140

85 E

1

45 S01

A 15

000

T P

0010 001 1

D- EFES

185

110 75

T S45 A

E R