Leetcode学习笔记：#235. Lowest Common Ancestor of a Binary Search Tree

Leetcode学习笔记：#235. 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).”

实现：

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 lowestCommonAncesotr(root.right, p, q);
	}else{
		return root;
	}
}

思路：
递归判断当前节点是大于还是小于两个值。只要有一个值不满足条件，说明已经找到了最低共同父节点。