首页 > 其他 > 详细

树节点递归

时间:2020-07-12 19:36:32      阅读:65      评论:0      收藏:0      [点我收藏+]
数据结构
 data: [
          {
          label: ‘广东‘,
          id:12,
          children: [{
            label: ‘广州‘,
            id:121,
            children: [
              {label: ‘天河‘,id:1213},
               {label: ‘越秀‘,id:1215},
                {label: ‘南山‘,id:1216},
                 {label: ‘番禺‘,id:1217},
            ]
          },
          {
            label: ‘佛山‘,
            id:122,
            children: [
               {label: ‘南海‘,id:1223},
               {label: ‘禅城‘,id:1225},
                {label: ‘顺德‘,id:1226},
                 {label: ‘狮山‘,id:1227},
             
            ]
          },
          {
            label: ‘深圳‘,
            id:123,
            children: [
              {label: ‘南山‘,id:1233},
               {label: ‘布吉‘,id:1235},
                {label: ‘罗湖‘,id:1236},
                 {label: ‘坪山‘,
                 id:1237,
                 children: [
              {label: ‘南山‘,id:12331},
               {label: ‘布吉‘,id:12352},
                {label: ‘罗湖‘,id:12363},
                 {label: ‘坪山‘,id:12374}]
                 },
            ]
          },
          ]
        },
         {
          label: ‘福建‘,
          id:22,
          children: [{
            label: ‘福州‘,
            id:221,
            children: [
              {label: ‘天河‘,id:2213},
               {label: ‘越秀‘,id:2215},
                {label: ‘南山‘,id:2216},
                 {label: ‘番禺‘,id:2217},
            ]
          },
          {
            label: ‘厦门‘,
            id:122,
            children: [
               {label: ‘南海‘,id:2223},
               {label: ‘禅城‘,id:2225},
                {label: ‘顺德‘,id:2226},
                 {label: ‘狮山‘,id:2227},
             
            ]
          },
          {
            label: ‘泉州‘,
            id:123,
            children: [
              {label: ‘南山‘,id:2233},
               {label: ‘布吉‘,id:2235},
                {label: ‘罗湖‘,id:2236},
                 {label: ‘坪山‘,id:2237},
            ]
          },
          ]
        },

方法

init(list){
       list.forEach(item =>{
          item.show = false
          this.arr.push(item.id)
          if (item.children) {
           this.init(item.children)
         }
       })
     console.log(new Set(this.arr))
},
     diguiclick(){
    this.init(this.data)
     },

 

树节点递归

原文:https://www.cnblogs.com/hwj369/p/13289342.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!