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
原创
2016-04-06 15:10:00 ·
239 阅读 ·
0 评论