What is heap tree?
- 1 Answers
- 1097 Views
- I also Faced
- E-Mail Answers
Answer / Anisha
A heap tree is a complete binary tree with the property that the key at each parent node is greater than or equal to (max-heap) or less than (min-heap) its children's keys. Heaps are used in priority queues, Huffman coding, and in sorting algorithms.
| Is This Answer Correct ? | 0 Yes | 0 No |
What are the categories of avl rotations?
Tell me the difference between the character array and a string.
1 Answers Honeywell, HPCL, Huawei, Zomato,
Define red-black trees.
How do you find the complexity of a bubble sort?
What is treemap chart?
What is array traversing?
What is difference between set and map?
How does a heap sort work?
Mention a few applications of linked lists?
What is Jagged Arrays?
How can someone display singly linked list from first to last?
Does linked list allow null values?
Windows 
