Time and space complexity of recursive random tree structure

Question

I am trying to find a good example to understand the time and the space complexity (in Big O notation) when recursively map a random tree.

I found examples for a bina