IBM
Company
Programming
Arrays
A complete binary tree with the property that the value at each node is atleast as large as the values at its children is known as..
a)binary search tree
b)AVL tree
c)completely balanced tree
d)Heap
Read Solution (Total 2)
-
- ans) d
A max-heap is a complete binary tree in which the value in each internal node
is greater than or equal to the values in the children of that node. - 9 years agoHelpfull: Yes(10) No(1)
- d
its heap because it has value of parent node greater than the child one compulsry - 7 years agoHelpfull: Yes(1) No(0)
IBM Other Question
Let p and q be two prime numbers such that p is greater than q. If 319 is their LCM then the difference of thrice of q and p is:
The ascending order of rational numbers -7/10,-5/8,-2/3 is:
a.-7/10,-2/3,-5/8
b.-7/10,-5/8,-2/3
c.-5/8,-7/10,-2/3
d.-2/3,-5/8,-7/10