Answer:
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.
In 1 gallon there are 3.8 liters
If it is
y is diretly proportional to x
y=kx
solve for y
3x+5y=0
5y=-3x
y=-3/5x
y=kx
constant of variation is -3/5
