code: def _build_bst_from_sorted_values(sorted_values):
      
      if len(sorted_values) == 0:
          return None
      mid_index = len(sorted_values) // 2
      root = Node(sorted_values[mid_index])
      root.left = _build_bst_from_sorted_values(sorted_values[:mid_index])
      root.right = _build_bst_from_sorted_values(sorted_values[mid_index + 1:])
      return root
docs: Recursively build a perfect BST from odd number of sorted values.
  
      :param sorted_values: Odd number of sorted values.
      :type sorted_values: [int | float]
      :return: Root node of the BST.
      :rtype: binarytree.Node