CUET PG 2025 — Computer PYQ

Solution:

Binary Heap ko array mein represent karte waqt, kisi node ke index $i$ se hum uske relative nodes ki position toh nikal sakte hain, par pure structure ki limit nahi.

1. Calculable Values (Jo nikal sakte hain):

• Parent Index: $P=\lfloor i/2\rfloor$

• Left Child Index: $L=2i$

• Right Child Index: $R=2i+1$

2. Non-Calculable Value (Jo nahi nikal sakte):

Heap Size ($n$) ek independent variable hai jo array ki total length ko darshata hai. Iska index $i$ ke saath koi functional relation nahi hota:

Right Answer:

Heap size