title: how to build a binary tree from preorder and inorder traversals
body: <p>Im doing an assignment on building a binary tree from the preorder and inorder traversals (a char in each Node) and im trying to wrap my brain around how to build the actual tree.</p>
  
  <p>Here is my thought process on how to accomplish this:</p>
  
  <ol>
  <li>store the first entry in the preorder as the root node</li>
  <li>search the inorder for that entry.</li>
  <li>take the chars to the left of the root node and save them as a char array.</li>
  <li>take the chars to the right of the root node and save them as a char array.</li>
  <li>make a new tree, with the root as the parent and its 2 children being the left and right char arrays.</li>
  <li>keep going recursively until the preorder length is 0.</li>
  </ol>
  
  <p>I have steps 1-4 taken care of, but im not too sure how to properly build my tree, and was wondering if anyone had any pointers. Thank you.</p>