How does max heap work?
- 1 Answers
- 978 Views
- I also Faced
- E-Mail Answers
Answer / Kaushlendra Kumar
'Max Heap' is a type of binary heap where the parent node has a greater value (key) than its child nodes. This means that the root node (at index 0) contains the maximum element in the heap. It follows certain properties: completeness, max-heap property, and degree property.
| Is This Answer Correct ? | 0 Yes | 0 No |
Explain implementation of traversal of a binary tree.
Why do we need a data structure?
Why is hashmap faster than arraylist?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
What is sorting in math?
What is difference between linear and non linear data structure?
What is the use of hashtable?
What is the difference between arrays sort and collections sort?
What is an externalizable interface?
Where is binary tree used?
Is heap sort faster than quicksort?
How would you reverse characters of an array without using indexing in the array.
Windows 
