Register

UGC NET CSE | June 2009 | Part 2 | Question: 28

• edited by
805 views
2 votes
2 votes

A binary tree is said to have heap property if the elements along any path :

  1. from leaf to root are non-increasing    
  2. from leaf to root are non-decreasing    
  3. from root to leaf are non-decreasing   
  4. from root to leaf are non-increasing
• edited by
User Avatar

2 Answers

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
rishu_darkshadow asked Sep 22, 2017
3,732 views
UGC NET CSE | June 2009 | Part 2 | Question: 27
In a full binary tree of height k, there are ______ internal nodes . 2k-1 2k-1 2k 2k+1
In a full binary tree of height k, there are ______ internal nodes .2k-1 2k-1 2k 2k+1
User Avatar
1 votes
1 votes
4 answers
2
rishu_darkshadow asked Sep 22, 2017
695 views
UGC NET CSE | June 2009 | Part 2 | Question: 26
Queue is a …………. list . $LIFO$ $LILO$ $FILO$ $FIFO$
Queue is a …………. list .$LIFO$ $LILO$ $FILO$ $FIFO$
User Avatar
0 votes
0 votes
1 answer
3
rishu_darkshadow asked Sep 22, 2017
585 views
UGC NET CSE | June 2009 | Part 2 | Question: 24
In a B tree of order m with p nodes the average number of splits is at most : 1/(⌈m/2⌉−1) ⌈m/2⌉−1 1/(m/2) None
In a B tree of order m with p nodes the average number of splits is at most :1/(⌈m/2⌉−1) ⌈m/2⌉−1 1/(m/2) None
User Avatar
–1 votes
–1 votes
0 answers
4
rishu_darkshadow asked Sep 24, 2017
578 views
UGC NET CSE | June 2009 | Part 2 | Question: 50
We cannot delete the __________ icon but we can made it invisible. Recycle My Computer Internet explorer None of the above
We cannot delete the __________ icon but we can made it invisible.Recycle My Computer Internet explorer None of the abov...
User Avatar
Link Copied!