mysql 菜单数据转成树状结构 （递归）

    var arr = [{ id: 1, name: '早上', pid: 0 }, { id: 2, name: '起床', pid: 1 }, { id: 3, name: '刷牙', pid: 1 }, { id: 4, name: '洗脸', pid: 1 }, { id: 5, name: '中午', pid: 0 }, { id: 6, name: '吃饭', pid: 5 }, { id: 7, name: '睡觉', pid: 5 }, { id: 8, name: '晚上', pid: 0 }, { id: 9, name: '洗脸', pid: 8 }, { id: 9, name: '洗脚', pid: 8 }, { id: 9, name: '睡觉', pid: 8 }]
    var getTreeOfArr = function (data, pid) {
      var newArr = [];
      for (var i = 0; i < data.length; i++) {
        var item = data[i];
        if (item.pid == pid) {
          var obj = {};
          obj.id = item.id;
          obj.name = item.name;
          obj.children = getTreeOfArr(data, item.id);
          newArr.push(obj);
        }
      }
      return newArr;
    };
    var res0 = getTreeOfArr(arr, '')
    console.log(res0)