2. Consider a tree T storing 100,000 entries. What is theworst-case height of T in the following cases ?
A. T is a binary search tree.
B. T is an AVL tree.
C. T is a (2,4) tree.
D. T is a red-black tree.
Expert Answer
An answer will be send to you shortly. . . . .