Binary Tree Level Order Traversal

class Solution:    """    @param root: The root of binary tree.    @return: Level order in a list of lists of integers    """    def levelOrder(self, root):        # write your code here        self.results = []        if not root:            return self.results        q = [root]        while q:            new_q = []            self.results.append([n.val for n in q])            for node in q:                if node.left:                    new_q.append(node.left)                if node.right:                    new_q.append(node.right)            q = new_q        return self.results