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)).
Your answer would look like this
Answer: 210 advanced tickets were sold. 130 same day tickets were sold.
Step-by-step explanation:
x= advanced tickets y=same day tickets
2x+3y=810 this equation represents the money
x+y=340 this equation represents the total number of tickets
x+y=340
<u>-x -x</u>
y=-340-x 2x+3(340-x)=810 210+y=340
2x+1020-3x=810 <u> -210 -210 </u>
-x+1020=810 y=130
<u> -1020 -1020</u>
<u>-x</u>=-<u>210</u>
-1 -1
x=210
Answer:
670
Step-by-step explanation:
First you have to fined the unit rate
1,500/25= 60
a do
300x60= 18,00-98
