js实现树形结构的节点排序编码

史学娇

已于 2024-01-26 12:31:34 修改

阅读量241

点赞数 1

分类专栏：数据结构处理文章标签： javascript

于 2024-01-26 12:29:30 首次发布

本文链接：https://blog.csdn.net/weixin_46151381/article/details/135863351

版权

数据结构处理专栏收录该内容

15 篇文章 0 订阅

订阅专栏

function encodeTree(array,config) {
  let encodedArray = [];
  let counter = 1;
  const order=config.order
  const children=config.children
  for (let i = 0; i < array.length; i++) {
    const item = array[i];
    const encodedItem = { ...item, [order]: counter++ };

    if (Array.isArray(item[children]) && item[children].length > 0) {
      encodedItem[children] = encodeTree(item[children],config);
    }
    encodedArray.push(encodedItem);
  }
  return encodedArray;
}

// 排序前
const inputArray = [
  { name: '节点1', childNode: [] },
  { name: '节点2', childNode: [
    { name: '子节点2-1', childNode: [] },
    { name: '子节点2-2', childNode: [] }
  ]},
  { name: '节点3', childNode: [
    { name: '子节点3-1', childNode: [] }
  ]}
];
console.log(inputArray,'原数组');
const encodedArray = encodeTree(inputArray,{order:'codeNumber',children:'childNode'});
console.log(encodedArray,'排序数组');

//排序后
const encodedArray=[
    {
        "name": "节点1",
        "childNode": [],
        "codeNumber": 1
    },
    {
        "name": "节点2",
        "childNode": [
            {
                "name": "子节点2-1",
                "childNode": [],
                "codeNumber": 1
            },
            {
                "name": "子节点2-2",
                "childNode": [],
                "codeNumber": 2
            }
        ],
        "codeNumber": 2
    },
    {
        "name": "节点3",
        "childNode": [
            {
                "name": "子节点3-1",
                "childNode": [],
                "codeNumber": 1
            }
        ],
        "codeNumber": 3
    }
]