0% found this document useful (0 votes)
45 views14 pages

Trees 1

Uploaded by

Aaaaa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
45 views14 pages

Trees 1

Uploaded by

Aaaaa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Tree

CEO
t
CFI coo

É TuDa
L
director A
fanaguy
I 2
SWE LEAD

parentof

g
a

an

of
w

Nfind
668
they
Can root be a leg y
got
Do all nodes have parent No root don't
can a leaf also be a subtree Yes
can a tree have multiple pots No

La
i
blue mode 4 not

depth 11 2
13
depth 6 3
depth 103 0
Ly

Height of a node x I the


of edges boom x to

farthest leaf in des enfants

height 102 2

height 32 3

height 23 2
Binary Tree every node
can have either 0 1 2

Trisha
Class Node
root

is
do
88 Wfff BT

IÉq

indicalisian
Traversal in BT

1 Preorder traversal
2 Postorder traversal
3 In order traverses
4 Level and traversal
Boot
preorder traversal

IN L R

preorder 88
1,216,8 9110,31 going
41 not two

void preorder not

If not NULL setum TC OCN


Sc Och
Print Coot
preorder root test
preorder not sight
Post order
L R N

door
70 To
9214,3

void postonder not

c Ocn

4
is
postorg cnet.at no
P 2dm cnet.gg

In order
L R
To
N

6,5 2,9 8,10 17,3 4,16 woot


void in ord l d

If not NULL return


yo OCN
Coot est Sc Och
110299
ist Coot
not sight
Inorder

Iterative inordes traversal


Build a tree If only inordu are gives
postordes

Iterative Inordu transversal

D
Y 7 2
668
a
foe Tau
6 5 2 16
9,8 10
1,7 3,4

cypr soot

while Carr now 11 St empty J

If Cyr NULL

f
St push Curr

422 Car 2 left

else

f
cu r St top c St pope

print Carr data


n

TC OCN
so OCH
In order
3 2 1

I in

In order
Postonder
3
3 2D
I 2

To
No duplicates
a
d Construct a binary bee with border Postoader

inorder

Postoadu 4752 6 3 1

Hashmap
d
value
key
arrival index
Build a tree will serum not of this
g
Node tree in CT post I sip ip sii ei

if Seip Sip setum Now

root Val post C e i p

fore i sii i seii itt Ocn


d

f
if C in Ci root at Ocr
I rootind in i
bseal

root new node root rat


root eat tree in post Sip 2 si
soot right tree in post t Ei

Schenn not notindta


6 5

mad
hash
NZ To O Cn
To O
SC OCN
SC OCH
in
2oogtind

root
Leifp

root 1 sii x sip

as soot t sii a sip

C I N
I
Oo
0000 n
I
N No
g levels N

x x

rootind in
q

FÉL
root
Lipp
3 4 10 11
I
8
D
O
O

if
8
I
O
2
Inordy 6 5 Y 3
Post 6 5 Y 3 210

td N

432 N p

N Z

80
O

Nt N I N Z t M

N2
NII

You might also like