[网络协议]jd 递归找到父节点

function findParents(treeData, id) {
    
    let breadcrumbArray = []
    var findele = (data, id) => {
        data.forEach((item, index) => {
            if (item.id === id) {
                breadcrumbArray.unshift(item.name)
                //breadcrumb += item.name + "  >&nbidsp;&nbsp"
                findele(treeData, item.pId)
            }
        })
    }
    findele(treeData, id)
    return breadcrumbArray.join("  > &nbsp")
}

function findParents(treeData, url) {

    let treeNode = "";
    treeData.forEach((item, index) => {
        if (item.u === url) {
            treeNode = item;
        }
    })
    if ("" === treeNode) {
        return
    }


    let id = treeNode.id;
    let breadcrumbArray = []
    var findele = (data, id) => {
        data.forEach((item, index) => {
            if (item.id === id) {
                breadcrumbArray.unshift(item.name)
                //breadcrumb += item.name + "  > &nbsp"
                findele(treeData, item.pId)
            }
        })
    }
    findele(treeData, id)
    return breadcrumbArray.join("  > &nbsp")
}