JS递归遍历树结构

上代码

// 树结构
const options = [
  {
    value: 'zhejiang',
    label: 'Zhejiang',
    children: [
      {
        value: 'hangzhou',
        label: 'Hangzhou',
        children: [
          {
            value: 'xihu',
            label: 'West Lake',
          },
        ],
      },
    ],
  },
  {
    value: 'jiangsu',
    label: 'Jiangsu',
    children: [
      {
        value: 'nanjing',
        label: 'Nanjing',
        children: [
          {
            value: 'zhonghuamen',
            label: 'Zhong Hua Men',
          },
        ],
      },
    ],
  },
];

//  递归函数
const Fn = data => {
	data.forEach((item, i) => {
		if (item.children) {
			// 调用递归函数
			Fn(item.children)
		}
		data[i].key = data[i].value
	})
}

//  调用
Fn(options)