What is heap tree explain with example?
- 1 Answers
- 1068 Views
- I also Faced
- E-Mail Answers
Answer / Raju Kumar Rai
A heap tree is a complete binary tree with the property that the parent nodes are always greater than (max-heap) or less than (min-heap) their children. An example of a max-heap would be: [1, 2, 7, 4, 5, 3, 6, 8, 9, 10]. Each node's value is greater than its children's values.
| Is This Answer Correct ? | 0 Yes | 0 No |
Can a binary tree be empty?
What are the tasks performed during preorder traversal?
What is ds heap sort?
Is file a data structure?
What are the operations that can be performed on a stack?
How memory is reserved using a declaration statement ?
Is array faster than arraylist?
How can a binary tree be represented using the rotation?
What is meant by a dynamic array?
Define ancestor and descendant ?
What is array simple?
Why quicksort is better than merge sort?
Windows 
