Suppose T is an initially empty search tree and we insert the sequence of keys 1,2,3,, in increasing order, into 7. Then the height of the resulting search tree T is
Select one
a. θ(log n ) regardless of whether I is a Splay tree or an AVL tree
b. θ(n) if is a Solby tree, but is loga #san AVL trec
c. θ(log n) it 7 is a Spiky tree, but is (n) T is a BST
d. θ (n) regardless of whether Tis a BST or a Splay tree or an AVL tree