解法一：递归
1 TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* TreeNode* lowestCommonAncest
阅读背景：
【LeetCode 235_二叉搜索树】Lowest Common Ancestor of a Binary Search Tree
来源：互联网
分享到：
