You insert the values 40, 20, 60, 10, 30, 50, 55 in that order into an empty binary search tree. Which value becomes the root?

• 20
• 60
• 10
• 40

Insert 6, 3, 9, 4, 1, 7, 8 into an empty binary search tree. Which becomes the root?

• 3
• 6
• 9

In that tree, how many comparisons find the value 8, counting every node visited?

With that same insert order, what becomes the right child of the node holding 3?

• 1
• 9
• 4

In the tree built by inserting 40, 20, 60, 10, 30, 50, 55 in that order, how many comparisons does it take to find the value 10, counting the comparison at every node you visit?

Using the same insert order, 40, 20, 60, 10, 30, 50, 55, what becomes the right child of the node holding 20?

• 30
• 10
• 60
• 40

Insert 2, 4, 6, 8, 10, 12, 14 in order. What shape results?

• A short bushy tree
• A long one sided chain
• Two separate roots

In that tree, where does the value 7 land?

• Right child of 4
• Left child of 6
• Left child of 9

A student inserts 9 as the left child of 5. Which rule breaks?

• Smaller left and larger right
• One root per tree
• No cycles allowed

How does search cost in that chain compare with a bushy tree of seven?

• Equal, shape never matters
• Chain costs like a list, far more steps
• Chain needs zero comparisons