def level_list(root):
    """Get full level order traversal of binary tree nodes.

    Example:
	>>> from leetcode_trees import binarytree
	>>> tree = binarytree.tree_from_list([5,1,4,None,None,3,6])
	>>> binarytree.print_tree(tree)
	   ___5___
	  1      _4_
		3   6
	>>> print(binarytree.level_representation(tree))
	[[5], [1, 4], [None, None, 3, 6]]

    The list of lists contain TreeNode objects.
    """
    curr_level = [root]
    levels = [curr_level]
    next_level = []
    while True:
        for node in curr_level:
            if node is not None:
                next_level.append(node.left)
                next_level.append(node.right)
            else:
                next_level.append(None)
                next_level.append(None)
        if not all(n is None for n in next_level):
            levels.append(next_level)
            curr_level = next_level
            next_level = []
        else:
            break
    return levels