text: """
  You are given the values from a preorder and an inorder tree traversal. Write a
  function that can take those inputs and output a binary tree.
  *Note: assume that there will not be any duplicates in the tree.*
  Example:
  Inputs:
  preorder = [5,7,22,13,9]
  inorder = [7,5,13,22,9]
  Output:
      5
     / \
    7  22
      /  \
     13   9
  """
  # Definition for a binary tree node.
  class TreeNode:
      def __init__(self, val=0, left=None, right=None):
          self.val = val
          self.left = left
          self.right = right
  
  def build_tree(preorder, inorder):
      # Your code here
      #given preorder and inorder, we must get construct the binary tree
  
      #root is the first element in pre-order
      
  
  