Creation of a data structure tree (first Order + middle order)

/* The result of the tree ordinal traversal is derived from the first order traversal and the middle order traversal: a d e B c F sequence traversal result is: D e A c F B Derivation process step 1: From the first sequence traversal to determine the root node is a, according to the central sequence traversal determines the root node of the Saozi right subtree so D e is the root node of the left subtree, C F B is the root node of the right Subtree Step 2: Determine the two children of root Node A by the first order traversal D B according to the sequence traversal to determine D for Zuozi B is the right subtree recursive step in the order of the result E is the right side of D, then the right of D is obtained E is the  root node  c F on the left of B is the  C F is Zuozi According to the first order traversal C is the root node according to the middle order traversal results F on the right  F C is the right subtree of c * /

Creation of a data structure tree (first Order + middle order)