m0_57929113的博客

原创 树结构转数组（递归）

function treeToArray(tree = [], result = []) {for (const item of tree) {result.push(item);if (item.children) {treeToArray(item.children, result);Reflect.deleteProperty(item, "children");}}return result.sort((a, b) => a.id - b.id);// return result;}console.