Question 1 1 pts An iterative version of a preorder traversal for a binary tree uses an stack O pricrity quouo bag Question 2 1 pts An iterative version of a level order traversal for a binary tree uses ain) pricrity queue O bag Question 3 1 pts A complete traversal of an n-node binary tree is aln)operation if visiting a node is O1) for the recursive implementation. O 0(1) olog n)