js 遍历树的层级关系的实现

1.遍历树的层级关系

1)先整理数据

2)找到id和数据的映射关系

3)然后找到父节点的数据,进行存储

  test() {
      const list = [
        { id: "123", parentId: "", children: [] },
        { id: "124", parentId: "123", children: [] },
        { id: "125", parentId: "124", children: [] },
        { id: "126", parentId: "125", children: [] },
        { id: "127", parentId: "126", children: [] }
      ];
      const mapList = [];
      const tree = [];
      list.forEach(item => {
        var item = {
          id: item.id,
          parentId: item.parentId,
          children: []
        };
        mapList[item.id] = item;
      });
      list.forEach(item => {
        const parentNode = mapList[item.parentId];
        if (!parentNode) {
          tree.push(item);
        } else {
          parentNode.children.push(item);
        }
      });
      console.log("tree", tree);
    },

猜你喜欢

转载自www.cnblogs.com/xuqp/p/10954849.html