little simpler version of above implementation . uses more space but atleast its easy to understand . all it does is makes 2 list one of larger and one of smaller element than root and then passes them into left and right sides concode_field_sep int small concode_elem_sep int big concode_field_sep boolean compare concode_elem_sep BigSmall nextBigSmall concode_elem_sep void main concode_elem_sep boolean sameBST concode_elem_sep boolean sameBST
boolean function ( int arg0 [ ] , int arg1 [ ] ) { List < Integer > loc0 = new ArrayList < > ( ) ; for ( int loc1 : arg0 ) { loc0 . add ( loc1 ) ; } List < Integer > loc2 = new ArrayList < > ( ) ; for ( int loc1 : arg1 ) { loc2 . add ( loc1 ) ; } return sameBST1 ( loc0 , loc2 ) ; }