Suppose that the following strings are inserted, in the order given, into an initially empty binary search tree:

"Green", "Violet", "Blue", "White", "Yellow", "Orange", "Red"

Which strings will be in leaves of the completed tree? (Select all that apply)

a		Blue
b		Green
c		Orange
d		Red
e		Violet
f		White
g		Yellow