2015年7月12日
[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 阅读全文
posted @ 2015-07-12 10:08 Grandyang 阅读(14956) 评论(2) 推荐(0)
Fork me on GitHub