二叉树两结点间的最短路径

let root = {
    val: 1,
    left: {
        val: 2,
        left: {
            val: 4,
            left: null,
            right: {
                val: 7,
                left: null,
                right: null
            }
        },
        right: null
    },
    right: {
        val: 3,
        left: {
            val: 5,
            left: null,
            right: null
        },
        right: {
            val: 6,
            left: {
                val: 8,
                left: null,
                right: null
            },
            right: null
        }
    }
}

function FindShortestPath(z, p, q) {
    let res = []
    let flag = false
    function findAncestor(node, n1, n2) {
        if (node === null || (node && (node.val === n1.val || node.val === n2.val))) {
            return node
        }
        let left = findAncestor(node.left, n1, n2)
        let right = fin