<awangdev>Construct Binary Tree from Inorder and Postorder Traversal_1.java
public int findMid(int[] arr, int start, int end, int key) {
        for (int i = start; i <= end; i++) {
            if (arr[i] == key) {
                return i;
            }
        }
        return -1;
    }
public int sample_funcname ( int [ ] var_0 , int var_1 , int var_2 , int var_3 ) {
  for ( int var_4 = var_1 ;
  var_4 <= var_2 ;
  var_4 ++ ) {
    if ( var_0 [ var_4 ] == var_3 ) {
      return var_4 ;
    }
  }
  return - 1 ;
}
