1151 LCA in a Binary Tree (30分)

普通二叉树的LCA
用二叉搜索树的方法会超时。因为不如二叉搜索树搜索的快。

难点：递归，画图理解即可。

#include <iostream>
#include <algorithm>
using namespace std;
const int SIZE = 30005;

int inOrder[SIZE];
int preOrder[SIZE];

struct Node {
    int data;
    Node* left,* right;
    Node() {left = right = NULL;}
} ;

void build(Node*& root, int inL, int inR, int preL, int preR) {
    if (inL > inR)  return ;
    if (root == NULL) {
        root = new Node();
        root->data = preOrder[preL];
    }
    int mid;
    for (mid = inL; mid <= inR; mid ++) {       //找根节点的下标(inOrder)
        if (inOrder[mid] == preOrder[preL])   break;
    }
    
    int numLeft = mid - inL;
    
    build(root->left, inL, mid - 1, preL + 1, preL + numLeft);
    build(root->right, mid + 1, inR, preL + numLeft + 1, preR);
}

int pathU[SIZE], pathV[SIZE];
int heightU, heightV;
int A;
int search(Node* root, int u, int v, bool& flag1, bool& flag2) {
    if (root == NULL)   return 0;

    int cnt = search(root->left, u, v, flag1, flag2) + search(root->right, u, v, flag1, flag2);

    if (root->data == u) {
        flag1 = true;
        cnt ++;
    }
    if (root->data == v) {
        flag2 = true;
        cnt ++;
    }

    if (cnt == 2 && A == -1) {
        A = root->data;
    }
    return cnt;
}

void postOrder(Node* root) {
    if (root == NULL)   return;
    cout << root->data << " ";
    postOrder(root->left);
    postOrder(root->right);
}

int main() {
    int M, N, u, v;
    scanf("%d %d", &M, &N);
    for (int i = 0; i < N; i ++) scanf("%d", &inOrder[i]);
    
    for (int i = 0; i < N; i ++) scanf("%d", &preOrder[i]);
    
    Node* root = NULL;
    build(root, 0, N - 1, 0, N - 1);

    for (int i = 0; i < M; i ++) {
        scanf("%d %d", &u, &v);
        A = -1;
        bool flag1 = false;
        bool flag2 = false;
        search(root, u, v, flag1, flag2);
        if (!flag1 || !flag2) {
            if (flag1) {
                printf("ERROR: %d is not found.\n", v);
                continue;
            } else if (flag2) {
                printf("ERROR: %d is not found.\n", u);
                continue;
            } else {
                printf("ERROR: %d and %d are not found.\n", u, v);
                continue;
            }
        }

        if (A == u) {
            printf("%d is an ancestor of %d.\n", u, v);
            continue;
        }
        if (A == v) {
            printf("%d is an ancestor of %d.\n", v, u);
            continue;
        }
        
        printf("LCA of %d and %d is %d.\n", u, v, A);
    }
    cin >> A;
    return 0;
}