Ask Question
15 January, 08:04

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.

+3
Answers (1)
  1. 15 January, 08:28
    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 the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers