无限极分类

标题

分享无限极分类代码

// 递归
public function recursionTree($arr,$key,$fkey,$num)
{ 
    $list = array();
    foreach($arr as $val){ 
        if($val[$fkey] == $num){ 
            $tmp = $this->recursionTree($arr,$key,$fkey,$val[$key]);
            if($tmp){ 
                $val['son'] = $tmp;
            }
            $list[] = $val;
        }
    }
    return $list;
}