找出二叉树中某两个节点的第一个公共祖先

boolean covers(TreeNode root,TreeNode p){
if(root==null) return false;
if(root==p) return true;
return covers(root.left,p)||covers(root.right,p);
}
TreeNode commonAncestorHelper(TreeNode root,TreeNode p,TreeNode q){
if(root==null) return null;
if(root==p||root==q) return root;
boolean isp_onLeft=covers(root.left,p);
boolean isq_onLeft=covers(root.left,q);
if(isp_onLeft!=isq_onLeft){
return root;
}
TreeNode childside=isp_onLeft?root.left:root.right;
return commonAncestorHelper(childside, p, q);
}
TreeNode commonAncestor(TreeNode root,TreeNode p,TreeNode q){
if(!covers(root,p) || !covers(root,q)) return null;
return commonAncestorHelper(root, p, q)
}//找出二叉树中某两个节点的第一个公共祖先