php递归无限分类、根据子类获取所有顶类

 //递归无限分类树
 public static function diGui($data, $pid)
 {
     $arr = collect([]);
     if (empty($data)) {
         return '';
     }

     foreach ($data as $key => $value) {
         if ($value['parent_id'] == $pid) {
             $value['submenu'] = self::diGui($data, $value['id']);
             $arr[] = $value;
         }
     }
     return $arr;
 }

 //根据子类id的所获取有父类
 public function getParents($data,$id){
     $tree=array();
     foreach($data as $item){
         if($item['id']==$id){
             if($item['parent_id']>0)
                 $tree=array_merge($tree,self::getParents($data,$item['parent_id']));
             $tree[]=$item;
             break;
         }
     }
     return $tree;
 }