JavaScript树形目录递归判断层数

  // 递归判断层数
  traverse(obj, count) {
    if (count) {
      count++
    } else {
      count = 1
    }
    for (let i in obj) {
       //floor为树形层数
      obj[i].floor = count

      if (obj[i].leafNodes.length > 0) {
        this.traverse(obj[i].leafNodes, count)
      }

    }
  },