Return the node with the most children

def getRootNode(nodes):
    '''Return the node with the most children'''
    max = 0
    root = None
    for i in nodes:
        if len(i.children) > max:
            max = len(i.children)
            root = i
    return root