列表结构转树结构

/**
 * 列表结构转树结构
 * @param data
 * @param id
 * @param parentId
 * @param children
 * @param rootId
 * @returns {*}
 */
export function handleTree(data: any, id: any, parentId: any, children: any, rootId: any) {
	id = id || 'id';
	parentId = parentId || 'parentId';
	children = children || 'children';
	rootId =
		rootId ||
		Math.min.apply(
			Math,
			data.map((item: any) => {
				return item[parentId];
			})
		) ||
		0;
	//对源数据深度克隆
	const cloneData = JSON.parse(JSON.stringify(data));
	//循环所有项
	const treeData = cloneData.filter((father: any) => {
		const branchArr = cloneData.filter((child: any) => {
			//返回每一项的子级数组
			return father[id] === child[parentId];
		});
		branchArr.length > 0 ? (father[children] = branchArr) : '';
		//返回第一层
		return father[parentId] === rootId;
	});
	return treeData !== '' ? treeData : data;
}