PAT 1151 LCA in a Binary Tree（30 分）- 甲级

原创

已于 2023-11-09 15:20:24 修改 · 8.8k 阅读

18 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #c++

于 2018-09-09 18:25:28 首次发布

The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.

Given any two nodes in a binary tree, you are supposed to find their LCA.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 1,000), the number of pairs of nodes to be tested; and N (≤ 10,000), the number of keys in the binary tree, respectively. In each of the following two lines, N distinct integers are given as the inorder and preorder traversal sequences of the binary tree, respectively. It is guaranteed that the binary tree can be uniquely determined by the input sequences. Then M lines follow, each contains a pair of integer keys U and V. All the keys are in the range