【poj 1330】 Nearest Common Ancestors 【Taejon 2002】
DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,...,16}.
原创
2017-10-09 16:01:13 ·
258 阅读 ·
0 评论