1. root(v): given a node v, find the root of the tree that contains v ... dynamic trees (i.e. trees that can change). 1.2 A naive algorithm.
確定! 回上一頁