1) 504cm
2) 216mm
3) 666ft
4) 301.44mm
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.
The answer is a
Explanation: I’m not too sure about it
There may be a relationship between 'x' and 'y', but we have no equation
that shows what it is. So we don't have the information we need to answer
the question.
