This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 1 year, 11 months ago.

• Author
Posts
EduGorilla
Keymaster
Select Question Language :

Consider the max heap given below, with three nodes marked as X,Y,Z. Let (x,y,z) be a tuples such that at node X you have value x, at node Y you have value y, and at node Z you have value z, and putting values (x,y,z) at their position does not go against the definition of a max heap. Also the tuples are chosen in such a way that all values in the heap are distinct and greater than equal to 1. Let S be the set of all such tuples.

(i) For every tuple (x,y,z) in S, y is the smallest value always.
(ii) There exists a tuple (x,y,z) in S such that x>z.
(iii) For every tuple (x,y,z) in S, z is always greater than x.
(iv) For every tuple (x,y,z) in S , y<z always.

### Options :-

1. Only (i) and (iv) is true
2. Only (i) and (iii) is true
3. Only (i) (iii) and (iv) is true
4. Only (ii) and (iv) is true
Are You looking institutes / coaching center for
• IIT-JEE, NEET, CAT
• Bank PO, SSC, Railways
Select your Training / Study category
Reply To: Consider the max heap given below, with three nodes marked as X,Y,Z. Let (x,y,z) be a tuples such th….

Verify Yourself