function getTree($data, $pId)
{
$tree = '';
foreach($data as $k => $v)
{
if($v['Id'] == $pId)
{
$v['Id'] = getTree($data, $v['cate_Id']);
$tree[] = $v;
//unset($data[$k]);
}
}
return $tree;
}
递归算法就是符合条件就不断的执行自身的函数,不符合就退出