consider the distance between left and right nodes rather than just the deepest ...

[github-actions]

https://api.github.com/acenturyandabit/workflowish/blob/56743892ae1027ef1f6a73bdd724b8d6dde8dac5/src/Workflowish/mvc/DFSFocus.tsx#L185

    }
    const leftDeepest = deepestCommonLevel(left.treePath, treePath);
    const rightDeepest = deepestCommonLevel(right.treePath, treePath);
    // TODO: consider the distance between left and right nodes rather than just the deepest common node
    return (leftDeepest > rightDeepest) ? left : right;
}