sorry, my fault, i thought you cannot create an tree only from preorder or postorder input and need them both
how would an alghoritm for preorder input look like (and for postorder its then easy)
we also learned alphabetical trees ,+-*/ tree and heap
thanks