树结构(递归方法实现无限极分类)

随便写，方便用的时候好查找

#递归方法实现无限极分类

function getTree($list,$pid=0,$level=0) {
static $tree = array();
foreach($list as $row) {
if($row['auth_pid']==$pid) {
$row['level'] = $level;
$tree[] = $row;
getTree($list, $row['auth_id'], $level + 1);
}
}
return $tree;
}