The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote
For a binary tree T with n vertices with n vertices,show tat the minimum possible height is logbase2(n+1)-1.Plz give the mathematical proof for it.
asked in Programming by Veteran (11.4k points) | 113 views
Thanx. This explanation is kind of okay!!!. :). Partially satisfied though not wholly. :)

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

33,720 questions
40,265 answers
38,904 users