二叉树的Diff算法
两棵树相等:
代码演示:两棵树相等的代码演示
function Node(value) {
this.value = value;
this.left = null;
this.right = null;
}
var a1 = new Node("a");
var b1 = new Node("b");
var c1 = new Node("c");
var d1 = new Node("d");
var e1 = new Node("e");
var f1 = new Node("f");
var g1 = new Node("g");
a1.left = c1;
a1.right = b1;
c1.left = f1;
c1.right = g1;
b1.left = d1;
b1.right = e1;
var a2 = new Node("a");
var b2 = new Node("b");
var c2 = new Node("c");
var d2 = new Node("d");
var e2 = new Node("e");
var f2 = new Node("f");
var g2 = new Node("g");
a2.left = c2;
a2.right = b2;
c2.left = f2;
c2.right = g2;
b2.left = d2;
b2.right = e2;
var diffList = [];
function diffTree(root1, root2, diffList) {
if (root1 === root2) return diffList;
if (root1 === null && root2 !== null) {
// 新增了节点
diffList.push({
type: "新增", origin: null, now: root2 });
} else if (root1 !== null && root2 === null) {
// 删除了节点
diffList.push({
type: "删除", origin: root1, now: null });
} else if (root1.value !== root2.value) {
// 相同位置的节点,值不相同,修改了节点
diffList.push