【Leetcode】235. Lowest Common Ancestor of a Binary Search Tree 解题报告

求二叉排序中的最近公共祖先 方法1 递归法 找到一个节点的值大于左变小于右边即可 class Solution1(object): def lowestCommonAncestor(self, root, p, q): p = p.val q = q.val if q < p: q,p = p,q re

>>阅读原文<<