edited by
3,225 views

1 Answer

Best answer
8 votes
8 votes
Heap or (max heap) which is a complete binary tree with every node has value more than or equal to  its children
selected by
Answer:

Related questions

5 votes
5 votes
3 answers
1
go_editor asked Jun 13, 2016
14,580 views
Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?Deleting a node whose location is givenSearching an unsor...
2 votes
2 votes
1 answer
2
go_editor asked Jun 13, 2016
17,857 views
The time required to search an element in a linked list of length n is$O(\log_2 n)$$O(n)$$O(1)$$O(n^2)$
9 votes
9 votes
1 answer
3
2 votes
2 votes
5 answers
4
ajit asked Sep 20, 2015
19,393 views
The minimum number of fields with each node of doubly linked list is1234