Ask Question
19 May, 16:12

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.

+4
Answers (1)
  1. 19 May, 18:07
    0
    3 and 5

    Step-by-step explanation:

    factor tree is more appropriate.
Know the Answer?
Not Sure About the Answer?
Find 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 you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers