LeetCode(46) Lowest Common Ancestor of a Binary （Search） Tree

Lowest Common Ancestor of a Binary Search Tree

题目描述

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6. Another example is LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

Lowest Common Ancestor of a Binary Tree

题目描述

Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3. Another example is LCA of nodes 5 and 4 is 5, since a node can be a descendant of itself according to the LCA definition.

题目解析

这里一个通用的解法是判断树的左右子树是否包含两个元素，若两元素分别分布在左右子树上，则公共祖先为当前结点，否则递归到当前结点的左（右）子树。该方法思路简单，但是问题也很明显，效率不高，并且对于binary search tree而言没有用上其性质，后续会更新效率更高的算法。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasNode(TreeNode* node, TreeNode* p, TreeNode* q)
    {
        if(node == NULL) return false;
        if(node == p || node == q) return true;
        return hasNode(node->left, p, q) || hasNode(node->right, p, q);
    }
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == p || root == q) return root;

        bool left = hasNode(root->left, p, q);
        bool right = hasNode(root->right, p, q);
        if(left && right) return root;
        if(left) return lowestCommonAncestor(root->left, p, q);
        if(right) return lowestCommonAncestor(root->right, p, q);
    }
};