Tree Traversal
in [Math]
|
Prev: Chapt9; Telescope best distance tool and if Doppler redshift were true, then Great Wall gets fuzzier #90; ATOM TOTALITY
Next: sierpinski constant for x^4 ?
From: Smisra on 16 May 2010 12:36 Given a preorder traversal string of a tree, how many trees can be constructed? Is there any bound for this?
From: James Waldby on 16 May 2010 13:19
On Sun, 16 May 2010 09:36:40 -0700, Smisra wrote: > Given a preorder traversal string of a tree, how many trees can be > constructed? Is there any bound for this? See <http://www.research.att.com/~njas/sequences/A000108> (Catalan numbers), fourth comment: "... the number of ordered rooted trees with n nodes, not including the root." Bound: C(n) = (2n)!/(n!(n+1)!) Also see recent thread <http://groups.google.com/group/sci.math/browse_thread/thread/2ce1088d564492de> -- jiw |