Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Generation of random binary trees
Replies: 10   Last Post: Mar 20, 2014 10:30 AM

 Messages: [ Previous | Next ] Topics: [ Previous | Next ]
 Gordon Sande Posts: 137 Registered: 5/13/10
Re: Generation of random binary trees
Posted: Feb 28, 2014 7:25 PM

On 2014-02-28 21:16:49 +0000, Mok-Kong Shen said:

> Am 28.02.2014 18:37, schrieb Herman Rubin:
>

>> Do you want equally likely labelled trees or equally likely
>> unlabelled ones? For the labelled trees, the method is fairly
>> easy; there are 2^(n-1)! labelled trees with n nodes, and going
>> from n-1 to n can be done by selecting a node at random and
>> branching there. For unlabelled trees, the problem is much
>> harder.

>
> Unlabelled. BTW, I forgot to mention that I am mainly interested
> in full binary trees (each internal node has exactly two children).

Then there is only one tree for a few special sizes. Or have I missed
something?

> M. K. Shen

Date Subject Author
2/26/14 Mok-Kong Shen
2/27/14 Herman Rubin
2/27/14 Mok-Kong Shen
2/28/14 Herman Rubin
2/28/14 Mok-Kong Shen
2/28/14 Gordon Sande
3/1/14 Mok-Kong Shen
2/28/14 Luis A. Afonso
3/1/14 Joe keane
3/2/14 Mok-Kong Shen
3/20/14 Mok-Kong Shen