Leetcode习题2的幂，二叉树的最近公共祖先

2的幂

class Solution:
    def isPowerOfTwo(self, n: int) -> bool:
        return n>0 and n&(n-1)==0

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

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        ancestor=root
        while True:
            if p.val<ancestor.val and q.val<ancestor.val:
                ancestor=ancestor.left  #如果p/q都小于根节点，在左子树找
            elif p.val>ancestor.val and q.val>ancestor.val:
                ancestor=ancestor.right
            else:
        		break

    	return ancestor

二叉树的最近公共祖先

class Solution:
    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
        if not root or root==p or root==q:
            return root

        left=self.lowestCommonAncestor(root.left,p,q)
        right=self.lowestCommonAncestor(root.right,p,q) #动态递归
        if not left:
            return right
        if not right:
            return left

        return root