 |
 |
12 of 18 |  |
 |
 |
MIT
l
Root tree, so cut
subtree
l
prefix becomes “treefix” computation.
»
Cut values of leaf nodes are degrees
»
Work up to root
l
Definition: are nodes below v
General Trees
v
¯
MIT
l
Root tree, so cut
subtree
l
prefix becomes “treefix” computation.
»
Cut values of leaf nodes are degrees
»
Work up to root
l
Definition: are nodes below v
General Trees
v
¯
|