Consider the following pair of recursive algorithms calling each other to traverse a binary tree. Algorithm weird Preorder (treeNode n) if (n ! = null) then print n get Value() weir postorder (n, get Right Child()) weirdPreOrder (n getLeftChild ()) Algorithm weirdPostorder(treeNode n) if (n! = null) then weird Preorder(n.getRight Child()) weird Postorder(n get RightChild()) print n.getValue Write the output being printed when we oot is executed on the following binary tree: Write the output being printed when Wei (root is execute Consider the binary tree traversal algorithm below. Algorithm queue Traversa (treeNode n) Input: a tree Node n Output: Prints the value of each node in the binary tree rooted at n Queue q leftarrow new Queue (); q enqueue(n); while(! Q.empty ()) do X leftarrow q.dequeue (); print x.getValue (); if (x.getLeftChild() ! = null) then q enqueue(x.getLeftChild() if (x.getRightChild() ! = null) then qenqueue(x.getRightChild (), Question: Write the output being printed when queue Traversal root is executed