Leetcode-Question-235: Lowest Common Ancestor of a Binary Search Tree

原文链接:
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/

题目:
Lowest Common Ancestor of a Binary Search Tree
Difficulty: Easy

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.

解析:
http://articles.leetcode.com/2011/07/lowest-common-ancestor-of-a-binary-search-tree.html

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注