I encounter such an exercise question as below and have no clue so far.
Consider using decision trees/forests to implement Boolean functions, i.e. classifiers from {0,1}n to{0,1}.
1) Give a good upper bound for the VC-dimension of decision trees with l leaves.
2) What is a good upper bound for the VC-dimension of a random forest (thresholded linear combination of decision trees) with k trees where each tree has l leaves?
For question 1), I understand the VC-dimension of a decision tree with l Leaves is at least l, but I cannot come up with the upper bound.
self-study
tag to questions such as yours, related to self-study, and describe what you have attempted so far in order to solve the exercise. We can then give you hints on how to proceed, but we cannot do your homework for you. In this specific case, I would start from the definition of Vapnik–Chervonenkis dimension. Do you have that clear in mind? $\endgroup$