Skip to content
ml-recall

#tree-depth

1 question from Decision Trees & Ensembles

Timed test

1 question · 1 min · score and explanations at the end

Take a test
Q 1 / 1Score 0 / 0

Question 1: Short answer

easyAI-checkedDecision Trees & Ensembles

A decision tree with binary splits is grown without restrictions on 1,000,000 distinct training instances, so it ends up with roughly one instance per leaf. If the tree were perfectly balanced, what would its depth be (rounded up to an integer)?

An integer