 |
 |
10 of 18 |  |
 |
 |
MIT
{
}
(
)
{
}
(
)
{
}
(
)
{
}
(
)
C
k
C
k
C
k
k
C
k
k
n
1,
1,
1
1,
1
1,
.
.
.
,
.
.
.
,
,
.
.
.
,
,
.
.
.
,
=
-
-
-
+
+
Analyzing a Tree
l
Suppose tree is a line, 1-constrains cut
Old cut
New cut
Add
Subtract
k+1
k-1
k