js 无限极分类

// 示例数据
const data = [
  { id: 1, name: '分类 1', parentId: 0 },
  { id: 2, name: '分类 1-1', parentId: 1 },
  { id: 3, name: '分类 1-1-1', parentId: 2 },
  { id: 4, name: '分类 2', parentId: 0 },
];

// 构建无限极分类函数
function buildTree(data, parentId = 0) {
  return data
    .filter(item => item.parentId === parentId)
    .map(item => ({
      ...item,
      children: buildTree(data, item.id),
    }));
}

const tree = buildTree(data);
console.log(JSON.stringify(tree, null, 2));