Ask Question
7 August, 15:02

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 complete, satisfies the heap property and, therefore, it is a heap.

+1
Answers (1)
  1. 7 August, 16:55
    0
    3 and 5

    Step-by-step explanation:

    factor tree is more appropriate.
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “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 complete, ...” in 📙 Mathematics if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers