logic of restore a binary tree based on travseral results, java -

logic of restore a binary tree based on travseral results, java -

can help explain logic of how draw original binary tree based on traversal results? know pre-order , in-order traversal, can't figure out start question. many in advance!

a binary tree has pre-order traversal result: a,b,d,h,i,e,f,c,g,k,j (treenodes) , same tree gives next in-order traversal: b,h,i,d,a,c,f,e,k,g,j. can draw tree structure?

you have combine both informations. start:

pre-order starts root => a. in-order can see nodes belong left , right subtree a:

left - b,h,i,d

right - c,f,e,k,g,j

from pre-order can see: left kid of b. in-order can see nodes belong left , right subtree of b:

left - none

right - h,i,d

continue...

java tree binary traversal