I know this isn't really a
Java based question but i didn't know where to post it else.
Given is the preorder traversal 5, 3, 1, 2, 4, 8, 7, 6, 9 of a binary search tree. I now whant to reconstruct the tree with the divide and-conquer-principle.
I do understand the preorder traversal but isn't it necessary to know the preorder as well as the inorder traversal to reconstruct the tree?
If anyone has an idea how to solve this, please give me a hint because I'm kind of lost here.