fun question!

[towelrack]

suppose I have two binary tree traversals in preorder and postorder sequence.
if there are n elements in the tree, how many different binary trees can I create using this information?

-you can also suppose there are 6 elements in the tree with these sequences:
preorder: a,b,d,e,f,g
postorder: d,e,b,g,f,a

also, tell me how you did it because I've been trying to find an equation for this forever.

[cnoeval]

By "forever" do you mean since your teacher assigned you the homework?

Nice try though...