树形结构数据, 已知某一子节点 ,一次向上获取所有父节点
//tree: 树形结构, menuid: 已知节点属性,(代码中判断id相等)function treeFindPath(tree, menuid) {var path = [];if (!tree) return [];var forFn = function (tree, menuid) {for (var i = 0; i < tree.length; i++) {// 存放最后返回的内容,返回text集合var data = tree[i];path.push(data.id);if (data.id === menuid) return path;if (data.children) {const findChildren = forFn(data.children,menuid);if (findChildren) return findChildren}path.pop()}}forFn(tree, menuid);return path;}