1# treeDiffer 2 3A JavaScript library for diffing trees in the browser, implementing the algorithm outlined in: http://epubs.siam.org/doi/abs/10.1137/0218082?journalCode=smjcat 4 5treeDiffer finds the minimum transactions to get from the first tree to the second tree. Nodes in each tree are labelled in [post order](https://en.wikipedia.org/wiki/Tree_traversal), starting from 0. Each transaction is of the form [nodeToRemove, nodeToInsert], where nodeToRemove or nodeToInsert (but not both) can be null. E.g: 6* `[1, null]` indicates that node 1 was removed from the first tree 7* `[null, 2]` indicates that node 2 was inserted into the second tree 8* `[3, 4]` indicates that node 3 in the first tree was changed into node 4 in the second tree 9 10## Usage 11 12Trees can be made of any type of node, as long as the nodes are connected in a [tree structure](https://en.wikipedia.org/wiki/Tree_%28data_structure%29). 13 14The abstract treeDiffer.treeNode class should be extended to work with the specific node type. 15 16## Demo 17 18Using treeDiffer to diff HTML: https://tchanders.github.io/treeDiffer.js/ 19