BFS关于Leetcode for Leaf相似树问题的错误答案

def isLeafSimilar(root1, root2):
    if not root1 and not root2:
        return True
    if not root1 or not root2:
        return False
    
    queue1 = [root1]
    queue2 = [root2]
    leaves1 = []
    leaves2 = []
    
    while queue1:
        node = queue1.pop(0)
        if not node.left and not node.right:
            leaves1.append(node.val)
        if node.left:
            queue1.append(node.left)
        if node.right:
            queue1.append(node.right)
    
    while queue2:
        node = queue2.pop(0)
        if not node.left and not node.right:
            leaves2.append(node.val)
        if node.left:
            queue2.append(node.left)
        if node.right:
            queue2.append(node.right)
    
    return leaves1 == leaves2

def isLeafSimilar(root1, root2):
    def getLeaves(root):
        leaves = []
        queue = [root]
        
        while queue:
            node = queue.pop(0)
            if not node.left and not node.right:
                leaves.append(node.val)
            if node.left:
                queue.append(node.left)
            if node.right:
                queue.append(node.right)
        
        return leaves
    
    leaves1 = getLeaves(root1)
    leaves2 = getLeaves(root2)
    
    return leaves1 == leaves2