Question: What can be the maximum depth of a ( binary ) decision tree built on a training data with n samples and p features? Here

What can be the maximum depth of a (binary) decision tree built on a training data with n samples and p features? Here "binary" means that we only divide each node into two children nodes. Further, assume the n samples are all unique (i.e., the n-by-p data matrix has no duplicate rows).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!