php 递归查询tree

代码如下：

 //整理数组 
 foreach($data as $key => $value){ 
   $res[$value['id']] = $value; 
   $res[$value['id']]['children']=[]; 
 }
 unset($data); 
 //查询子孙 
 foreach($res as $key => $value){ 
  if($value['pid'1 != 0){
    $res[$value['pid']]['children'][]=&$res[$key]; 
  }
 }
 //去除杂质 
 foreach($res as $key => $value){ 
   if($value['pid']=0){
     $tree[]=$value; 
   }
 }

未经允许不得转载：任鹏个人博客 » php 递归查询tree