PAT-甲级-1151 LCA in a Binary Tree (30 分)

最新推荐文章于 2022-10-12 18:41:05 发布

黑火的柠檬树下快乐多

最新推荐文章于 2022-10-12 18:41:05 发布

阅读量137

点赞数

分类专栏：甲级 PAT

本文链接：https://blog.csdn.net/valcanoshan/article/details/97819791

版权

给定中序和先序遍历序列，找到二叉树中多对节点的最近公共祖先。通过DFS遍历树，判断节点位置关系来确定公共祖先。

摘要由CSDN通过智能技术生成

1151 LCA in a Binary Tree (30 分)

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 of int