Answer Posted / Harshit Kumar Vishnoi
In Heaps, the structure property requires that the parent node is always greater than or equal to (in Max Heap) or less than or equal to (in Min Heap) its child nodes. This ensures that the largest (Max Heap) or smallest (Min Heap) element is always at the root of the heap.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
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.
Write a program for Sorting an Array. Which sorting will you prefer?
