Register

ISRO CSE 2008 | Question: 75

• edited by
4,311 views
4 4 votes

A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as

  1. binary search tree
  2. AVL tree
  3. completely balanced tree
  4. Heap

1 Answer

Best answer
10 10 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
Voting & Accepting an answer helps improve the community
Answer:
← Previous · ISRO CSE 2008 | Ques...Next → · ISRO CSE 2008 | Ques...
← Previous in category · ISRO CSE 2008 | Ques...Next in category → · singly linked list
Position:
Show:

Related questions

5 5 votes
3 answers 3 answers
18.3k
18.3k views
go_editor asked Jun 13, 2016
18,324 views
ISRO CSE 2008 | Question: 72
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 2 votes
1 answers 1 answer
19.4k
19.4k views
go_editor asked Jun 13, 2016
19,375 views
ISRO CSE 2008 | Question: 71
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)$
10 10 votes
2 answers 2 answers
18.7k
18.7k views
go_editor asked Jun 13, 2016
18,710 views
ISRO CSE 2008 | Question: 70
Stack A has the entries a, b, c (with a on top). Stack B is empty. An entry popped out of stack A can be printed immediately or pushed to stack B. An entry popped out of ...
2 2 votes
5 answers 5 answers
23.7k
23.7k views
ajit asked Sep 20, 2015
23,721 views
ISRO CSE 2008 | Question: 76
The minimum number of fields with each node of doubly linked list is1234