Consider the binary tree traversal algorithm below. Algorithm queueTraversal(treeNode n) Input: a treeNode n Output: Prints the value of each node in the binary tree rooted at n Queue q new Queue(); q.enqueue(n); while (! q.empty()) do xq.dequeue(); print x.getValue(); if (x.getLeftChild() != null) then q.enqueue( x.getLeftChild()); if (x.getRightChild() != null ) then q.enqueue( x.getRightChild()); Question: Write the output being printed when queue Traversal(root) is executed.