无限极分类

private function GetTree($arr,$pid,$step){
  global $tree;
  foreach($arr as $key=>$val) {
    if($val['pid'] == $pid) {
      $flg = str_repeat('--',$step);
      $val['title'] = $flg.$val['title'];
      $tree[] = $val;
      $this->GetTree($arr , $val['id'] ,$step+1);
    }
  }
  return $tree;
}

$tree = $this->GetTree($info, 0, 0);

$info = Array ( [0] => Array ( [id] => 1 [idstr] => [title] => 微迪加 [level] => 0 [pid] => 0 [path] => 000001 [company_id] => 1 [create_time] => 2018-06-09 13:44 [update_time] => 0 [status] => 1 ) [1] => Array ( [id] => 2 [idstr] => [title] => 技术部 [level] => 1 [pid] => 1 [path] => 000001-000002 [company_id] => 1 [create_time] => 2018-06-09 13:44 [update_time] => 0 [status] => 1 ) [2] => Array ( [id] => 3 [idstr] => [title] => 产品部 [level] => 1 [pid] => 1 [path] => 000001-000003 [company_id] => 1 [create_time] => 2018-06-09 13:44 [update_time] => 0 [status] => 1 ) [3] => Array ( [id] => 4 [idstr] => [title] => 技术一组 [level] => 2 [pid] => 2 [path] => 000001-000002-000004 [company_id] => 1 [create_time] => 2018-06-09 13:44 [update_time] => 0 [status] => 1 ) )

原文地址:https://www.cnblogs.com/soiq-1123/p/9159560.html