GATE CS 2018 (Forenoon) — Question 56

Data StructuresBinary Search Trees (BSTs) & Binary HeapsNAT2 marksHard

The number of possible min-heaps containing each value from \(\{1, 2, 3, 4, 5, 6, 7\}\) exactly once is _____.
Practise the full 2018-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Binary Search Trees (BSTs) & Binary HeapsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group