The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
140 views
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 Boss (13.6k points) | 140 views
0
Thanx. This explanation is kind of okay!!!. :). Partially satisfied though not wholly. :)

Please log in or register to answer this question.

Related questions

0 votes
0 answers
4
asked Dec 4 in Algorithms by neerajyadav (171 points) | 41 views


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

44,071 questions
49,594 answers
162,952 comments
65,786 users