You are given a node-labeled rooted tree with n nodes.
Define the query (x, k): Find the node whose label is k-th largest in the subtree of the node x. Assume no two nodes have the same labels.
The first line contains one integer n (1
For each query (x, k), output the index of the node whose label is the k-th largest in the subtree of the node x.
5 1 3 5 2 7 1 2 2 3 1 4 3 5 4 2 3 4 1 3 2 3 2
5 4 5 5
Amber的play with tree系列的题....
