|
algorithms
|
|
|
|
|
Bookmarks
|
|
|
|
|
|
|
|
|
|
Save Link
Create/Add to List
|
|
|
|
|
|
Given a rooted tree T and two nodes u and v, find the furthest node from the root that is an ancestor for both u and v.
http://www.topcoder.com/tc?module=Static&d1=tutori
created by algorithms on 2008-06-14 11:06:54
|
|
|