Random tree (unordered)

Another example of random rooted trees (see also random tree and random tree II). Reload the page to generate a new tree.

This time, the tree is unordered, i.e. it doesn't have any natural ordering, except for the partial one implied by the hierarchy. Therefore, sibling nodes can be placed in arbitrary order in the visualization. This leads to possibly have many different visualizations for the same unordered rooted tree (only its topology is relevant), that is undesirable.

In order to reduce the degrees of freedom of the visualization, the tree is sorted by subtree height: Taller subtrees are drawn before shorter ones. This partial ordering does not solve the problem completely, leaving unmanaged many cases of ambiguity (e.g. two sibling subtrees with the same height). See this more advanced example for an unambiguous solution to this problem.