I am currently trying to compare the complexity of models. Among the models I have are some trees. The trees are not parametric models, hence they don't have the notion of 'trainable parameters' that are used in information criterion (AIC / BIC). I was wondering if there is a way to compare the complexity of trees to models with trainable parameters. Intuitively I would use the number of values to encode the model. So the complexity of the model would be the number of splits (split level) + the number of leafs (terminal value).
Is this approach correct ? Is there better way to compare trees complexity to other models ?