In a Heap tree

  1. Home

Question:In a Heap tree

1.Values in a node are greater than every value in the left subtree and smaller than right subtree

2.Values in a node are greater than every value in children of it

3.Both of the above conditions apply

4.None of the above conditions applies

Posted by R4R Team
  1. In a Heap tree
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!