function lowestCommonAncestor(root, node1, node2) {

  // instantiate 2 arrays to keep track of paths

  const path1 = [];

  const path2 = [];

​

  // obtain the paths of each node from root

  if (!getPath(root, path1, node1) || !getPath(root, path2, node2)) {

    return false;

  }

​

  let i = 0;

  // compare the two until they differentiate or we hit the end

  while (i < path1.length && i < path2.length) {

    if (path1[i] != path2[i]) {

      break;

    }

    i++;

  }

​

  return path1[i - 1];

​

  function getPath(root, path, k) {

    if (!root) {

      return false;

    }

​

    // basic DFS