Question:Tree algorithms typically run in time O(d) . What is d? 

A The depth of the tree 
B The number of divisions at each level 
C The number of nodes in the tree 
D The total number of entries in all the nodes of the tree 

+ Answer
A 

+ 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