public boolean sameBST1(int arr1[], int arr2[]){
        List<Integer> list1 = new ArrayList<>();
        for(int i : arr1){
            list1.add(i);
        }
        List<Integer> list2 = new ArrayList<>();
        for(int i : arr2){
            list2.add(i);
        }
        
        return sameBST1(list1, list2);
    }
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
@param arr1
@param arr2
@return
src/com/interview/tree/IdenticalTrees.java