如何解析python二叉树的最近公共祖先

/** * Definition for a binary tree node. * type TreeNode struct { *     Val int *     Left *TreeNode *     Right *TreeNode * } */ func lowestCommonAncestor(root *TreeNode, p *TreeNode, q *TreeNode) *TreeNode {    if root!=nil && contain(root.Left,p)&& contain(root.Left,q){        return lowestCommonAncestor(root.Left,p,q)    }         if root!=nil && contain(root.Right,p)&& contain(root.Right,q){        return lowestCommonAncestor(root.Right,p,q)    }     return root}func contain(root *TreeNode, p *TreeNode)bool{    if root==nil{        return false    }    if root.Val==p.Val{        return true    }    return contain(root.Left,p)||contain(root.Right,p)}

func lowestCommonAncestor(root *TreeNode, p *TreeNode, q *TreeNode) *TreeNode{   var l,r []*TreeNode   _,l=findPath(root,p)   _,r=findPath(root,q)   l=append([]*TreeNode{root},l...)   r=append([]*TreeNode{root},r...)//    for i:=0;i//     fmt.Println("l->",l[i].Val)//    }//    for j:=0;j//        fmt.Println("r->",r[j].Val)//    }   i:=0   if len(l)==0 ||len(r)==0{       return root   }   for i       i++   }   return l[i-1]}
func findPath(root *TreeNode, p *TreeNode)(bool,[]*TreeNode){    var path []*TreeNode    if root==nil{        return false,path    }    if root.Val==p.Val{        return true,path    }    if ok,path:=findPath(root.Left,p);ok{        path=append([]*TreeNode{root.Left},path...)        //fmt.Println(root.Left.Val,"len",len(path))        return true,path    }
    if ok,path:=findPath(root.Right,p);ok{         path=append([]*TreeNode{root.Right},path...)         //fmt.Println(root.Right.Val,"len",len(path))        return true,path    }    return false,path}