def countNotes(root):
    """
    Classic use case: divide & conquer
    
    Count how many nodes are in binary tree.
    Use divide & conquer.
    """
    def helper(node):
        if node is None: return 0
        return 1 + helper(node.left) + helper(node.right)
    return helper(root)