The Gateway to Computer Science Excellence
0 votes
7 views

A binary tree of height $h$ can have at most minimum of _______ elements where $n$ is the height of the tree.

  1. $2^n$
  2. $2^n+1$
  3. $2^n+1$
  4. $2^{2n}$
in Others by Boss (17.5k points)
recategorized by | 7 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
198,060 comments
104,692 users