InorderTreeComparison.js

class Node {
  value = null;
  leftChild = null;
  rightChild = null;

  constructor(value) {
    this.value = value
  }
}

/**
 * Time Complexity: O(n)
 * Space Complexity: O(0)
 */
function compareInorder(tree1, tree2) {
  if (!tree1 && !tree2) return true;

  if (tree1 && !tree2) return false;
  if (!tree1 && tree2) return false;

  if (compareInorder(tree1.leftChild, tree2.leftChild) === false) {
    return false;
  }

  if (tree1.value != tree2.value) {
    return false;
  }

  if (compareInorder(tree1.rightChild, tree2.rightChild) === false) {
    return false;
  }

  return true;
}

const tree1 = new Node(5);
tree1.leftChild = new Node(4);
tree1.rightChild = new Node(3);
tree1.rightChild.rightChild = new Node(2);
tree1.rightChild.rightChild.leftChild = new Node(1);

const tree2 = new Node(5);
tree2.leftChild = new Node(4);
tree2.rightChild = new Node(3);
tree2.rightChild.rightChild = new Node(2);
tree2.rightChild.rightChild.leftChild = new Node(1);

console.log(compareInorder(tree1, tree2));