In a previous question there was a definition of weight-balanced and a question regarding red-black trees.
This question is to ask the similar question, but for treaps.
The question is:
Is there some $ \mu > 0 $ such that the expectation of $ \frac{|N_L| + 1}{|N| + 1} $ not less than $ \mu $ and not greater than $ 1 - \mu $ in treaps that the number of nodes is big enough?
Sorry for my poor English.
