Consider a tree t storing 100,000 entries. what is the worst-case height of t in the following cases?

(a) t is an avl tree.
(b) t is a (2,4) tree.
(c) t is a red-black tree.
(d) t is a splay tree.
(e) t is a binary search tree.

Step-by-step explanation:

a.) The worst-case height of an AVL tree or red-black tree with 100,000 entries is 2 log 100, 000.

b.) A (2, 4) tree storing these same number of entries would have a worst-case height of log 100, 000.

c.) A red-black tree with 100,000 entries is 2 log 100, 000

d.) The worst-case height of T is 100,000.

e.)  A binary search tree storing such a set would have a worst-case height of 100,000.

560

hope this : )

. + λrh() e 1 1 2 4 4 4 4 4 3 4 4 4 4 4 + th−1(− s(x)2 dx ω + λrh−1() e 2 1 2 4 4

step-by-step explanation: