Question 9 The number of different binary trees that can be made from 2 nodes that contain the key values 3 and 6 is 2. True False Question 10 Suppose xOrder is one of our binary search tree traversal...

Question 9

The number of different binary trees that can be made from 2 nodes that contain the key values 3 and 6 is 2.

True

False

Question 10

Suppose xOrder is one of our binary search tree traversal methods that is passed a tree node,node, and a queue,q.

Which traversal order is provided by the following code?

   xOrder(node.getLeft(), q);

   xOrder(node.getRight(), q);

   q.enqueue(node.getInfo());

preorder

levelorder

inorder

postorder

None of these is correct.