LeetCode235. 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 p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Given binary search tree:  root = [6,2,8,0,4,7,9,null,null,3,5]

 

Example 1:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.

Example 2:

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
Output: 2
Explanation: The LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

 

Note:

• All of the nodes' values will be unique.
• p and q are different and both values will exist in the BST.

思路：

这道题我首先想到的是先纪律路径，然后再看他们的分支再什么地方，但是看过答案后发现没那么复杂。

1 vector辅助解法

/**
 * 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:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
		vector<TreeNode*> vP, vQ;
		TreeNode* tmp = root;
		while (root) {
			vP.push_back(root);
			if (root->val < p->val) root = root->right;
			else if (root->val > p->val) root = root->left;
			else break;
		}
		root = tmp;
		while (root) {
			vQ.push_back(root);
			if (root->val < q->val) root = root->right;
			else if (root->val > q->val) root = root->left;
			else break;
		}
		TreeNode* pre = root;
		int i = 0;
		while (i < vP.size() && i < vQ.size()) {
			if (vP[i] == vQ[i]) pre = vP[i];
			else break;
            i++;
		}
		return pre;
    }
};

2 递归解法

/**
 * 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:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
		if (root->val < q->val && root->val < p->val)
			return lowestCommonAncestor(root->right, p, q);
		else if (root->val > q->val && root->val > p->val) 
			return lowestCommonAncestor(root->left, p, q);
		else return root;
    }
};

3 迭代解法

/**
 * 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:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
		while (root) {
			if (root->val < p->val && root->val < q->val) root = root->right;
			else if (root->val > p->val && root->val > q->val) root = root->left;
			else return root;
		}
		return NULL;
    }
};