归档 2015年7月11日

[LeetCode]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 ...

继续阅读

昨天

明天

归档