字节一面：给定一个二叉树, 找到该树中两个指定节点间的最短距离 #82

function TreeNode(val) {
this.val = val;
this.left = this.right = null;
}