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)).
Answer:
71424
Step-by-step explanation:
176.03 is the answer because A=P(+rt) P is the amount of money r is rate which is the interest and t is time which is the month
If the shape of the room is a square, then the square root of the sum of the squares of the the two adjacent sides will give the diagonal.
i.e.

Since the square root of the sum of the squares of the the two adjacent sides is 24.04 and not 18.79, therefore, the shape of the room is not a square.