如下图
    image.png

    1. const Node = require("../common")
    3. // 二叉树1
    4. let a1 = new Node('a');
    5. let b1 = new Node('b');
    6. let c1 = new Node('c');
    7. let d1 = new Node('d');
    8. let e1 = new Node('e');
    9. let f1 = new Node('f');
    10. let g1 = new Node('g');
    11. a1.left = c1;
    12. c1.left = f1;
    13. b1.left = d1;
    14. a1.right = b1;
    15. b1.right = e1;
    16. c1.right = g1;
    18. // 二叉树2
    19. let a2 = new Node('a');
    20. let b2 = new Node('b');
    21. let c2 = new Node('c');
    22. let d2 = new Node('d');
    23. let e2 = new Node('e');
    24. let f2 = new Node('f');
    25. let g2 = new Node('g');
    26. a2.right = c2;
    27. c2.left = f2;
    28. b2.left = d2;
    29. a2.left = b2;
    30. b2.right = e2;
    31. c2.right = g2;
    32. /**
    33.  * 二叉树左右子树交换的比较
    34.  * @param {*} root1 二叉树1
    35.  * @param {*} root2 二叉树2
    36.  */
    37. function comparisonExchangeTree(root1, root2) {
    38.     if (root1 == root2) return true;
    39.     if (root1 != null && root2 == null || root1 == null && root2 != null) return false;
    40.     if (root1.value != root2.value) return false;
    41.     return comparisonExchangeTree(root1.left, root2.left) && comparisonExchangeTree(root1.right, root2.right) || comparisonExchangeTree(root1.left, root2.right) && comparisonExchangeTree(root1.right, root2.left)
    42. }
    43. console.log(comparisonExchangeTree(a1,a2))

    导入的common.js

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