递归 解决 Cascader 子数据回显
树查询:通过子id获取所有父节点
//根据 单元id 获取选择数组
// 树查询:通过子id获取所有父节点
getTreeParent (treeData, searchId, parentAttr = 'parentid', childAttr = 'sid') {
var arrRes = [];
if (treeData.length == 0) {
if (!!searchId) {
arrRes.unshift(treeData)
}
return arrRes;
}
let rev = (data, nodeId) => {
for (var i = 0, length = data.length; i < length; i++) {
let node = data[i];
if (node[childAttr] == nodeId) {
arrRes.unshift(node)
rev(treeData, node[parentAttr])
break;
}
else {
if (!!node.children) {
rev(node.children, nodeId);
}
}
}
return arrRes;
};
arrRes = rev(treeData, searchId)
arrRes = arrRes.map(v => v[childAttr])
return arrRes;
},