PHP递归获取菜单

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/licanfeng1/article/details/82624498

//首先做一个类内的变量，存储一下相关的数组：
 public $tree = null;
 //然后做个测试方法，用于输出结果
 public function test() {
        $res = M('channel')->where('fatherid is null')->select();
        $this->createtree($res);
        dump($this->tree);
 }
 //这里是递归方法
 private function createtree(array $data = null, $lv = 1) {
        for ($i = 0; $i < count($data); $i++) {
            $data[$i]['lv'] = $lv;
            $this->tree[count($this->tree)] = $data[$i];
            $res = M('channel')->where('fatherid='.$data[$i]['cid'])->select();
            $this->createtree($res, ($lv + 1));
        }
 }

3。把上一步的数据转为树型状的数组
代码如下：
function getTree($data, $pId)
{
$tree = '';
foreach($data as $k => $v)
{
   if($v['cate_ParentId'] == $pId)
   {         //父亲找到儿子
    $v['cate_ParentId'] = getTree($data, $v['cate_Id']);
    $tree[] = $v;
    //unset($data[$k]);
   }
}
return $tree;
}
$tree = getTree($data, 0);