Uh hi, it's me again. I have another question.

It's another one about binary search trees.

I made one that works. I can tell that it works by traversing it in order. I've seen a lot of examples of traversing by recursion and that is what I used but I found that it's nearly impossible to count the number of levels and the number of elements on each level.

I tried to see if it was possible to count it in the recursive function but haven't really got anywhere.

Does anyone have a fresh approach to figuring this out?