235. Lowest Common Ancestor of a Binary Search Tree

最新推荐文章于 2020-02-26 19:44:50 发布

SHURamos

最新推荐文章于 2020-02-26 19:44:50 发布

阅读量176

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/shuramos/article/details/70738256

版权

Leetcode 专栏收录该内容

220 篇文章 0 订阅

订阅专栏

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).”

        _______6______
       /              \
    ___2__          ___8__
   /      \        /      \
   0      _4       7       9
         /  \
         3   5

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.

Subscribe to see which companies asked this question.

My verbose solution:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        List<TreeNode> d1 = new ArrayList<>();
		List<TreeNode> d2 = new ArrayList<>();
		helper(d1, root, p);
		helper(d2, root, q);
		TreeNode re = null;
		int i = 0;
		while (i < d1.size() && i < d2.size() && d1.get(i).val == d2.get(i).val)
			re = d1.get(i++);
		return re;
    }
    
    private void helper(List<TreeNode> data, TreeNode root, TreeNode t) {
		if (root.val == t.val) {
			data.add(root);
			return;
		} else if (root.val > t.val) {
			data.add(root);
			helper(data, root.left, t);
		} else {
			data.add(root);
			helper(data, root.right, t);
		}
	}
}

better solution by others

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if (root.val > p.val && root.val > q.val)
			return lowestCommonAncestor(root.left, p, q);
		else if (root.val < p.val && root.val < q.val)
			return lowestCommonAncestor(root.right, p, q);
		else
			return root;
    }
}