(a) Construct a binary search tree T for the following set S of elements in the order given: S = {..

(a) Construct a binary search tree T for the following set S
of elements in the order given:

S = { INDIGO, GREEN, CYAN, YELLOW, RED, ORANGE, VIOLET}

(b) How many comparisons are made for the retrieval of
yellow from the tree corresponding to the one drawn in 10.1(a)?

(c) For what arrangements of elements of S will the
associated binary search tree turn out to be skewed?

(d) For the binary search tree(s) constructed in I 10.1(c)
how may comparisons are made for the retrieval of yellow?