Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Binary Heap

Consider the height of a tree as the number of edges in the longest path between the root node and leaf nodes. If T is a min-heap of height 3, then what is the smallest number of nodes that T can have?

1

4

2

15

3

7

4

8

Share: WhatsApp Telegram X

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters