YZV 201E - Recitation 12 Pre-Quiz

Which of the statements about binary search tree is FALSE?

• Data is placed in the tree in a certain order.

• Values in the left subtree should be bigger than the value in the root.

• The right and left subtrees of a root node have the binary search tree property.

• In the binary search tree, each data is located in only 1 node.

Which statement is FALSE, if we write the tree to the file in-order?

• The data in the tree will be written to the file in alphabetical order.

• When reading from the file and recreating tree, tree will be unbalanced.

• "write_inorder” function will be more problematic than "write_preorder" when we want to recreate the tree from the file.

• BSTs cannot be written in-order format to the file.

Given a set of n distinct elements and an unlabelled binary tree with n nodes. How many ways can we match those?

• 0

• 1

• n!

• n

Which of the following traversal outputs the data in sorted order in a BST?

• Pre-order

• In-order

• Post-order

• Level-order

The following numbers are inserted into an empty BST in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height?

• 2

• 3

• 4

• 6