Register
Dark Mode

ISRO2008-75

in DS edited by
3,225 views
4 votes
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
in DS edited by
by
3.2k views

1 Answer

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

Related questions

2 votes
2 votes
5 answers
4
ajit asked in DS Sep 20, 2015
19,407 views
ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4
ajit asked in DS Sep 20, 2015
by ajit
19.4k views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!