Yes, a binary tree can be a maxheap. Consider a binary search tree with two values 3 and 5, where 5 is at the root. The tree is
1 answer:
You might be interested in
No, it's always okay to ask if you don't understand a question. Anyway, for this problem, we just have to plug in the value for <em>V </em>to solve for <em>P</em> :
A number to the power of 1/3 is the same as taking a cube root.
The perimeter of one face of the cube is 20m.
A number to the power of 1/3 is the same as taking a cube root.
The perimeter of one face of the cube is 20m.