PAT 1151 LCA in a Binary Tree

原题链接：1151 LCA in a Binary Tree (30分)
关键词：LCA
参考的柳神的博客：PAT 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.

Output Specification:

For each given pair of U and V, print in a line LCA of U and V is A. if the LCA is found and A is the key. But if A is one of U and V, print X is an ancestor of Y. where X is A and Y is the other node. If U or V is not found in the binary tree, print in a line ERROR: U is not found. or ERROR: V is not found. or ERROR: U and V are not found…
Sample Input:

6 8
7 2 3 4 6 5 1 8
5 3 7 2 6 4 8 1
2 6
8 1
7 9
12 -3
0 8
99 99

Sample Output:

LCA of 2 and 6 is 3.
8 is an ancestor of 1.
ERROR: 9 is not found.
ERROR: 12 and -3 are not found.
ERROR: 0 is not found.
ERROR: 99 and 99 are not found.

lca算法：

• 中序遍历区间分成 [inl, preRoot - 1] preRoot [preRoot + 1, inr]
• 从前序遍历中根节点开始找 pre[preRoot] ，根据中序遍历的序号可以确定搜索方向。
• a、b在当前根的两侧，当前根就是lca
• a、b在当前根的左（右）侧，则递归到当前根的左（右）子树
• 当a或者b其中一个成为了当前的根，说明他是另外一个的lca

代码：

#include <iostream>
#include <vector>
#include <map>
using namespace std;

const int N = 10000 + 10;
int m, n; //询问结点对数以及二叉树中的结点数量
vector<int> in, pre;  //中序inorder 前序preorder 
map<int, int> pos;  //结点值 <-> 在中序中的位置

int lca(int inl, int inr, int preRoot, int a, int b){   //左端位置、右端位置、当前的根位置、a、b

    int inRoot = pos[pre[preRoot]]; //当前的根在中序遍历中的位置
    int aIn = pos[a], bIn = pos[b]; //a、b在中序遍历中的位置
    
    //a、b都在当前根的左边，搜索当前根的左子树
    if (aIn < inRoot && bIn < inRoot)   
        lca(inl, inRoot-1, preRoot+1, a, b);
    //a、b在当前根的一左一右，当前根就是lca
    else if ((aIn < inRoot && bIn > inRoot) || (aIn > inRoot && bIn < inRoot))
        printf("LCA of %d and %d is %d.\n", a, b, in[inRoot]);
    //a、b都在当前根的右边，同理       
    else if (aIn > inRoot && bIn > inRoot)
        lca(inRoot+1, inr, preRoot+1+(inRoot-inl), a, b);
    //a、b中有人成为了当前根
    else if (aIn == inRoot)
            printf("%d is an ancestor of %d.\n", a, b);
    else if (bIn == inRoot)
            printf("%d is an ancestor of %d.\n", b, a);
}

int main(){
    scanf("%d%d", &m, &n);
    in.resize(n + 1), pre.resize(n + 1);
    for(int i = 1; i <= n; i ++ ){
        scanf("%d", &in[i]);
        pos[in[i]] = i;
    }
    for(int i = 1; i <= n; i ++ ) scanf("%d", &pre[i]);
    
    for(int i = 0; i < m; i ++ ){
        int u, v;
        scanf("%d%d", &u, &v);
        if(pos[u] == 0 && pos[v] == 0) printf("ERROR: %d and %d are not found.\n", u, v);
        else if(pos[u] == 0) printf("ERROR: %d is not found.\n", u);
        else if(pos[v] == 0) printf("ERROR: %d is not found.\n", v);
        else 
            lca(1, n, 1, u, v);
    }
    return 0;
}

注意：可以不建树、注意中序遍历和前序遍历提供的结点之间的信息。