         }
 
         return length
-    }
-
-
-    /// Finds the Deepest node that can be merged "Right to Left", and returns the Left / Right matching touple, if any.
-    ///
-    private func findMergeableNodes(left: [ElementNode], right: [ElementNode]) -> [MergeablePair]? {
-        var currentIndex = 0
-        var matching = [MergeablePair]()
-
-        while currentIndex < left.count && currentIndex < right.count {
-            let left = left[currentIndex]
-            let right = right[currentIndex]
-
-            guard left == right else {
-                break
-            }
-
-            let pair = MergeablePair(left: left, right: right)
-            matching.append(pair)
-            currentIndex += 1
-        }
-
-        return matching.isEmpty ? nil : matching
     }
 }
 

    ///
    ///
    private func merge(left: Branch, right: Branch) -> Branch? {
        guard let mergeableCandidate = findMergeableNodes(left: left.nodes, right: right.nodes),
            let target = mergeableCandidate.last?.left
        else {
            return nil

            previous = consolidated
        }

        return output
    }

