Remove duplicate code

Author: ibbem

src/main/java/org/variantsync/diffdetective/variation/diff/DiffTree.java

@@ -454,35 +454,7 @@ public ConsistencyResult isConsistent() {
     }
 
     public boolean isSameAs(DiffTree b) {
-        var visited = new HashSet<DiffNode>();
-        return isSameAs(this.getRoot(), b.getRoot(), visited);
-    }
-
-    private static boolean isSameAs(DiffNode a, DiffNode b, Set<DiffNode> visited) {
-        if (!visited.add(a)) {
-            return true;
-        }
-
-        if (!(
-                a.getDiffType().equals(b.getDiffType()) &&
-                a.getNodeType().equals(b.getNodeType()) &&
-                a.getFromLine().equals(b.getFromLine()) &&
-                a.getToLine().equals(b.getToLine()) &&
-                (a.getFormula() == null ? b.getFormula() == null : a.getFormula().equals(b.getFormula())) &&
-                a.getLabel().equals(b.getLabel())
-        )) {
-            return false;
-        }
-
-        Iterator<DiffNode> aIt = a.getAllChildren().iterator();
-        Iterator<DiffNode> bIt = b.getAllChildren().iterator();
-        while (aIt.hasNext() && bIt.hasNext()) {
-            if (!isSameAs(aIt.next(), bIt.next(), visited)) {
-                return false;
-            }
-        }
-
-        return aIt.hasNext() == bIt.hasNext();
+        return getRoot().isSameAs(b.getRoot());
     }
 
     @Override