Consider the binary tree traversal algorithm below. Algorithm queue Traversal (tree Node n) Input: a tree Node 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 O) do x *- q. dequeue (); print x. get Value (); if (x. get Left Child () ! = null) then q. enqueue (x. get Left Child ()); if (x. get Right Child Q != null) then q. enqueue (x. get Right Child ()); Write the output being printed when queue Traversal (root) is executed