递归穿透 递归tree

    public function recursion($array,$pid,$treeList){
        if($array){
            foreach ($array as $key=>$value){
                if($value['pid']==$pid){
                    $treeList[]=$value['id'];
                    $treeList=$this->recursion($array,$value['id'],$treeList);
                }
            }
        }
        return $treeList;
    }
    $this->recursion($companDir,0,[])

    public function recursion($array,$pid){
        if($array){
            foreach ($array as $key=>$value){
                if($value['pid']==$pid){
                    $block['id']=$value['id'];
                    $block['child']=$this->recursion($array,$value['id']);
                    $treeList[]=$block;
                }
            }
        }
        return $treeList;
    }
    $this->recursion($companDir)