235. 二叉搜索树的最近公共祖先

二叉搜索树的最近公共祖先

• 难度: medium
• 原始链接: https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree
• 标签: 一次遍历

解法一: 一次遍历

go

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val   int
 *     Left  *TreeNode
 *     Right *TreeNode
 * }
 */

func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {
  if p.Val > q.Val {
    return lowestCommonAncestor(root, q, p)
  }
  if root.Val < p.Val {
    return lowestCommonAncestor(root.Right, q, p)
  } else if root.Val > q.Val {
    return lowestCommonAncestor(root.Left, q, p)
  }
  return root
}