Question:In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2. 

A about log(n) 
B about 2*log(n) 
C about 3*log(n) 
D about 4*log(n) 

+ Answer
B 

+ Report

Md. Habib Ullah

Editor, VCampus

Your Name

Your Email

Type of Report
Spelling MistakeIncorrect AnswerGrammar MistakeContent MissingImproper Text FormatInsufficient AnswerDuplicate QuestionImproper Sentence StructureImproper Equation/FormulaOther

Description