Binary Tree Line by Line Level Order Traversal Time Complexity

Question

Here is the Code of Level Order Traversal Line by Line. How come the Time Complexity is O(n) and not O(n2).

def levelOrder(root): queue = [root]

while