javascript手写一维数组转换树节点生成树结构

编程题:手写一维数组转换树节点

思路一般是先遍历一遍查找节点,接着递归分类父子节点

var array = [
    {pid: 4, id: 6617, name: "a",subNode:[]},
    {pid: 5, id: 666, name: "a",subNode:[]},
    {pid: 4, id: 6616, name: "a",subNode:[]},
    {pid: 6616, id: 66161, name: "a",subNode:[]},
    {pid: -1, id: 0, name: "a",subNode:[]},
    {pid: 0, id: 4, name: "a",subNode:[]},
    {pid: 0, id: 5, name: "a",subNode:[]},
    {pid: 4, id: 10, name: "a",subNode:[]},
    {pid: 10, id: 451, name: "a",subNode:[]},
    {pid: 0, id: 98, name: "a",subNode:[]},
    {pid: 98, id: 23, name: "a",subNode:[]},
    {pid: 98, id: 523, name: "a",subNode:[]}
];

var toTree = function(tarArray) { }

toTree(array);

代码实现

js:生成树结构(一维数组转树形结构、生成树菜单)

用了点es6

var toTree = function(tarArray) {
    var resultTree;

    var findChildren = tree=>{
        tree.forEach(node=>{
            node.children = tarArray.filter(cNode=>cNode.pid === node.id);
            if (node.children.length) {
                findChildren(node.children);
            }
        }
        );
    }
    if (tarArray && tarArray.length > 0) {
        // step1:把跟节点首先放进数组,根节点支持:null 0 ""
        const tmpTree = tarArray.filter(node=>!node.pid);
        // step2:递归生成节点及子节点数据
        findChildren(tmpTree)
        resultTree = tmpTree;
    }
    findChildren = null;
    return resultTree;
}

输出结果

json result

[
  {
    "pid": 0,
    "id": 4,
    "name": "a",
    "subNode": [
      
    ],
    "children": [
      {
        "pid": 4,
        "id": 6617,
        "name": "a",
        "subNode": [
          
        ],
        "children": [
          
        ]
      },
      {
        "pid": 4,
        "id": 6616,
        "name": "a",
        "subNode": [
          
        ],
        "children": [
          {
            "pid": 6616,
            "id": 66161,
            "name": "a",
            "subNode": [
              
            ],
            "children": [
              
            ]
          }
        ]
      },
      {
        "pid": 4,
        "id": 10,
        "name": "a",
        "subNode": [
          
        ],
        "children": [
          {
            "pid": 10,
            "id": 451,
            "name": "a",
            "subNode": [
              
            ],
            "children": [
              
            ]
          }
        ]
      }
    ]
  },
  {
    "pid": 0,
    "id": 5,
    "name": "a",
    "subNode": [
      
    ],
    "children": [
      {
        "pid": 5,
        "id": 666,
        "name": "a",
        "subNode": [
          
        ],
        "children": [
          
        ]
      }
    ]
  },
  {
    "pid": 0,
    "id": 98,
    "name": "a",
    "subNode": [
      
    ],
    "children": [
      {
        "pid": 98,
        "id": 23,
        "name": "a",
        "subNode": [
          
        ],
        "children": [
          
        ]
      },
      {
        "pid": 98,
        "id": 523,
        "name": "a",
        "subNode": [
          
        ],
        "children": [
          
        ]
      }
    ]
  }
]
  • 1
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

程序员斯文

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值