technology hard fill in the blank

The minimum number of nodes in a binary tree of height h is ________.

  1. h+1
  2. qXR / CAD4TB
  3. Platform
  4. Parameter

Answer: h+1

Minimum nodes occur in a skewed tree (each node has only one child): height h has h+1 nodes. Maximum nodes in a perfect binary tree of height h is 2^(h+1)-1. Understanding tree properties is essential for algorithm analysis questions in technical government exams.

Topic Data Structures
Exam Relevance SSC JE, Banking IT, UPSC

More Technology Questions