MIT
61
2-Crossing Trees
l
Cut corresponds to
two
subtrees:
l
n
2
table entries
l
fill in
O
(
n
2
)
time with dynamic program
v
w
keep
discard
