1 votes 1 votes 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. Devshree Dubey asked Jul 3, 2016 Devshree Dubey 393 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply LeenSharma commented Jul 3, 2016 reply Follow Share http://cs.stackexchange.com/questions/6277/why-is-the-minimum-height-of-a-binary-tree-log-2n1-1 0 votes 0 votes Devshree Dubey commented Jul 5, 2016 reply Follow Share Thanx. This explanation is kind of okay!!!. :). Partially satisfied though not wholly. :) 0 votes 0 votes Please log in or register to add a comment.