Binary Search Tree

Would this Binary Tree be considered a Binary Search Tree?

• Yes 

• No

Is this a binary search tree and what is the runtime for traversal?

• Yes, O(log(n))

• No, O(n)

• Yes, O(n)

• No, O(log(n))

When adding a node with the same value as its root where would it go?

• Left

• Right

• Depends on the implementation

• doesn't matter

If I deleted the root from the Binary Search Tree what could I replace it with?

• 7

• 14

• 3

• 1

What does this code do?

• Find all the values less than root.item

• Find the max value

• Find the min value

What does this code do?

• Count all the items greater than k.

• Count all the items less than k

• Count all the items equal to k

Which of these Trees is a Binary Search Tree?

• 
• 
•