Assuming a d-heap means the order of the tree representing the heap is d.
Most of the computer applications use binary trees, so they are 2-heaps.
A heap is a complete tree where each level is filled (complete) except the last one (leaves) which may or may not be filled.
The height of the heap is the number of levels. Hence the height of a binary tree is Ceiling(log_2(n)), for example, for 48 elements, log_2(48)=5.58.
Ceiling(5.58)=6. Thus a binary tree of 6 levels contains from 2^5+1=33 to 2^6=64 elements, and 48 is one of the possibilities. So the height of a binary-heap with 48 elements is 6.
Similarly, for a d-heap, the height is ceiling(log_d(n)).
We know that m<JKL = m<JKM + m<MKL
Let's substitute the values from the picture into our equation above.
10x - 11 = 43 + 8x - 20
Combine like terms.
10x - 11 = 8x + 23
Subtract 8x from both sides and add 11 to both sides.
2x = 34
Divide both sides by 2
x = 17
m<MKL = 8x - 20 = 8(17) - 20 = 136 - 20 = 116 degrees.
m<JKL = 10x - 11 = 10(17) - 11 = 170 - 11 = 159 degrees.
Answer:
8 cm
Step-by-step explanation:
divide 400 by 50 which is 8.
1700 and 2550
You might want to double check that. I'm not certain.
