Interested to Buy Any Domain ? << Click Here >> for more details...
What is the advantage of the heap over a stack?
- 1 Answers
- 1063 Views
- I also Faced
- E-Mail Answers
Answer / Namita Mishra
The main advantage of a Heap over a Stack is that it allows for efficient management of priorities. A Heap automatically maintains the property where a parent node always has a greater (Max-Heap) or smaller (Min-Heap) value than its child nodes, making it suitable for implementing priority queues, dijkstra's algorithm, and heap sort.
| Is This Answer Correct ? | 0 Yes | 0 No |
How many types of linked lists are there?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
Explain Array
Can we put null value in hashmap?
What is the difference between a stack and an array?
Explain circular linked list?
How would you use bsearch() function to search a name stored in array of pointers to string?
What is a stable sort?
Is hashset synchronized?
What member function places a new node at the end of the linked list?
What do you mean by level of the tree?
What is insertion sort technique?
Windows 
