树的公共祖先

// lca_bst
node *lca_bst(node *n, node *p, node *q) {
    if((n->val - p->val) * (n->val - q->val) <= 0) return n;
    else if(n->val < p->val && n->val < q->val) return lca_bst(n->right, p, q);
    else return lca_bst(n->left, p ,q);
}
// lca_common
node* lca_common(node *n, node *p, node *q) {
    if (n == NULL) return NULL;
    if (n->val == p->val || n->val == q->val) return n;
    node *left = lca_common(n->left, p, q);
    node *right = lca_common(n->right, p, q);
    if (left != NULL && right != NULL) return n;
    if (left != NULL) return left;
    if (right != NULL) return right;
    return NULL;
}

树的公共祖先

原文：https://www.cnblogs.com/littlepage/p/12677340.html