比较两个子树的不同之处 此处并没有比较走右子树互换的情况
    image.png

    1. const Node = require("../common")
    2. // 二叉树1
    3. let a1 = new Node('a');
    4. let b1 = new Node('b');
    5. let c1 = new Node('c');
    6. let d1 = new Node('d');
    7. let e1 = new Node('e');
    8. let f1 = new Node('f');
    9. let g1 = new Node('g');
    10. a1.left = c1;
    11. c1.left = f1;
    12. b1.left = d1;
    13. a1.right = b1;
    14. b1.right = e1;
    15. c1.right = g1;
    17. // 二叉树2
    18. let a2 = new Node('a');
    19. let b2 = new Node('b');
    20. let c2 = new Node('c');
    21. let d2 = new Node('d');
    22. let e2 = new Node('e');
    23. let f2 = new Node('f');
    24. let g2 = new Node('g');
    25. a2.left = c2;
    26. c2.left = f2;
    27. b2.left = d2;
    28. a2.right = b2;
    29. b2.right = e2;
    30. c2.right = g2;
    31. /**
    32.  *两个二叉树那里不同，不同之处在哪
    33.  * @param {*} root1 二叉树1
    34.  * @param {*} root2  二叉树2
    35.  * @param {*} diffList  不同列表
    36.  * @returns
    37.  * [
    38.  * 第一种情况
    39.  * {type:"新增",origin:"null",now:"null",}
    40.  * 第二种情况
    41.  * {type:"删除",origin:"null",now:"null",}
    42.  * 第三种情况
    43.  * {type:"替换",origin:"null",now:"null",}
    44.  * ]
    45.  */
    46. function compareDiffTree(root1, root2, diffList = []) {
    47.     if (root1 == root2) return diffList;
    48.     if (root1 == null && root2 != null) {
    49.         diffList.push({ type: "新增", origin: "null", now: root2, })
    50.     } else if (root1 != null && root2 == null) {
    51.         diffList.push({ type: "删除", origin: root1, now: "null", })
    52.     } else if (root1.value != root2.value) {
    53.         diffList.push({ type: "替换", origin: root1, now: root2, })
    54.         compareDiffTree(root1.left, root2.left, diffList)
    55.         compareDiffTree(root1.right, root2.right, diffList)
    56.     } else {
    57.         compareDiffTree(root1.left, root2.left, diffList)
    58.         compareDiffTree(root1.right, root2.right, diffList)
    59.     }
    61. }
    62. var diffList = [];
    63. compareDiffTree(a1, a2,diffList)
    64. console.log(diffList)

    导入的common.js

    1. module.exports = class Node{
    2.     constructor(value){
    3.         this.value = value;
    4.         this.left = null;
    5.         this.right = null;
    6.     }
    7. }