关于链表的广度优先遍历代码，本地测试没有问题

interface iLinkNode{
    curNode:Node | null,
    nextNode:iLinkNode | null
}
function breadthFirstTraverse2(root:Node){
    const queueHead:iLinkNode = {//哨兵节点
        curNode:null,
        nextNode:null
    }
    let queueEnd:iLinkNode = {//尾指针，先指向root
        curNode:root,
        nextNode:null
    }
    queueHead.nextNode = queueEnd
    while(queueHead.nextNode !== null){
        const nowNode = queueHead.nextNode.curNode
        if(nowNode == null) break

        visitNode(nowNode)

        const childNodes = nowNode.childNodes
        if(childNodes.length){
            childNodes.forEach(child =>{
                let n:iLinkNode = {
                    curNode:child,
                    nextNode:null
                }
                queueEnd.nextNode = n
                queueEnd = n
            })
        }

        queueHead.nextNode = queueHead.nextNode.nextNode//头节点出队

    }
}