Implementation of the core tree differencing algorithm of Chawathe. This algorithm takes two {@link Node} treesgenerates a matching between the nodes of both trees and calculates an edit script of {@link TreeEditOperation} thattransform the left into the right tree.
The implementation style is not clean, i.e., it uses single character method and variable names, because the implementation should reflect the original algorithm from the paper as much as possible.
@author Beat Fluri
@see TreeEditOperation
@see Node