Interested to Buy Any Domain ? << Click Here >> for more details...
Define max and min heap, also the search time of heap.
- 1 Answers
- 1095 Views
- GrapeCity, I also Faced
- E-Mail Answers
Answer Posted / Megha Agarwal
"Max Heap and Min Heap are types of binary heaps used in data structures.n1. Max Heap: A Max Heap is a complete binary tree with the property that the parent node is greater than or equal to its child nodes. The maximum value is always at the root.n2. Min Heap: A Min Heap is a complete binary tree with the property that the parent node is less than or equal to its child nodes. The minimum value is always at the root.n3. Search time for both max and min heaps in the average case is O(log n)."
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is a classloader in java?
What is the difference between equals() and == in java?
What is a constructor overloading in java?
What is an object in java and how is it created?
What are the differences between heap and stack memory in java?
What is java string pool?
explain different ways of using thread? : Java thread
Differentiate between static and non-static methods in java.
Write a java program to find the route that connects between Red and Green Cells. General Rules for traversal 1. You can traverse from one cell to another vertically, horizontally or diagonally. 2. You cannot traverse through Black cells. 3. There should be only one Red and Green cell and at least one of each should be present. Otherwise the array is invalid. 4. You cannot revisit a cell that you have already traversed. 5. The maze need not be in the same as given in the above example
Is minecraft 1.15 out?
How to sort array in descending order in java?
What is the difference between break and continue statements?
Explain public static void main(string args[]) in java.
Realized?
What do you mean by an interface in java?
