二叉树的最近公共祖先

一般的二叉树：

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14

func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode {      if root==p||root==q||root==nil{          return root      }      left:=lowestCommonAncestor(root.Left,p,q)      right:=lowestCommonAncestor(root.Right,p,q)      if left!=nil&&right!=nil{          return root      }      if left==nil{          return right      }      return left }

　　

二叉搜索树：

?

1 2 3 4 5 6 7 8 9

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