The basic task sounds like this: build a minimal set of commands for transforming tree A into tree B. Problem: the general algorithm for constructing a set of operations required to transform one tree into another has a speed of O (n3). Cubic time complexity means that if we have a tree with a thousand elements (well, the average static of such a UI), then we will need to do one billion operations to update them. Will not work. Experienced guys know: if you need to do it faster, put the cash! Well, in general, we need to make some......