递归递归递归

function DG(htmlDom, n) {
  n++;
  for (var i = 0; i < htmlDom.length; i++) {
    var navSubmenu = htmlDom[i].nav_submenu;
    var item = htmlDom[i];
    if (navSubmenu.length) {
      menuHtml +=
        '<li class="son-node">';
      menuHtml +=
        '<div class="can-pull flex">' +
        '  <a href="' + href + '">' + item.title + '</a>' +
        '  <i class="icon iconfont icon-pull"></i>' +
        '</div>';
      menuHtml += '<ul class="sonUl padding-' + n + '">';

      DG(navSubmenu, n)
      menuHtml += '</ul>';
      menuHtml += '</li>';
    } else {
      menuHtml +=
        '<li class="self-node">' +
        '  <a href="' + href + '">' + item.title + '</a>' +
        '</li>';
    }
  }
  menuPopUl.html(menuHtml);
}

getTreeData(list) {
      var treeData = [];
      var map = {};
      list.forEach(function (item) {
        map[item.statusId] = item;
      });
      list.forEach(function (item) {
        var parent = map[item.statusPid];
        if (parent) {
          (parent.children || (parent.children = [])).push(item);
        } else {
          item["children"] = [];
          treeData.push(item);
        }
      });
      return treeData;
    },