关于#树形结构#的问题，如何解决？

递归处理树形结构

```javascript
data: [{
          label: '一级 1',
          TypeID: "1",
            Children:{
              ModelTreeItem:[{
                label: '二级 1-1',
                TypeID: "2",
                Children:{
                  ModelTreeItem:[{
                    label: '二级 1-2',
                    TypeID: "3",
                  }]
                } 
              }]
            } 
        }, {
          label: '一级 2',
          TypeID: "4",
          Children:{
            ModelTreeItem:[{
              label: '二级 2-1',
              TypeID: "5",
            }, {
              label: '二级 2-2',
              TypeID: "6",
            }]
          }
        }, {
          label: '一级 3',
          TypeID: "7",
          Children:{
            ModelTreeItem:[{
              label: '二级 2-1',
              TypeID: "8",
            }, {
              label: '二级 2-2',
              TypeID: "9",
            }]
          }
        }],

递归处理一下就好了

const arr = [
  {
    label: '一级 1',
    TypeID: '1',
    Children: {
      ModelTreeItem: [
        {
          label: '二级 1-1',
          TypeID: '2',
          Children: {
            ModelTreeItem: [
              {
                label: '二级 1-2',
                TypeID: '3'
              }
            ]
          }
        }
      ]
    }
  },
  {
    label: '一级 2',
    TypeID: '4',
    Children: {
      ModelTreeItem: [
        {
          label: '二级 2-1',
          TypeID: '5'
        },
        {
          label: '二级 2-2',
          TypeID: '6'
        }
      ]
    }
  },
  {
    label: '一级 3',
    TypeID: '7',
    Children: {
      ModelTreeItem: [
        {
          label: '二级 2-1',
          TypeID: '8'
        },
        {
          label: '二级 2-2',
          TypeID: '9'
        }
      ]
    }
  }
]
const formatTree = (data) => {
  data.forEach((item) => {
    if (item.Children) {
      item.children = item.Children.ModelTreeItem
      delete item.Children
      formatTree(item.children)
    }
  })
}
formatTree(arr)
console.log(arr);

然后呢？