PHP无限级分类：一棵树形成一个数组

<?php

$cate=array(

array('id'=>1,'name'=>'html','parent'=>0),

array('id'=>2,'name'=>'javascript','parent'=>0),

array('id'=>3,'name'=>'div+css','parent'=>0),

array('id'=>4,'name'=>'linux','parent'=>0),

array('id'=>5,'name'=>'mysql','parent'=>0),

array('id'=>6,'name'=>'其他','parent'=>0),

array('id'=>7,'name'=>'php','parent'=>0),

array('id'=>8,'name'=>'字符串','parent'=>7),

array('id'=>9,'name'=>'数组','parent'=>7),

array('id'=>10,'name'=>'对象','parent'=>7),

array('id'=>11,'name'=>'jquery','parent'=>2),

array('id'=>12,'name'=>'ajax','parent'=>2),

array('id'=>13,'name'=>'存储引擎','parent'=>5),

array('id'=>14,'name'=>'事务','parent'=>5),

array('id'=>15,'name'=>'存储过程','parent'=>5),

array('id'=>16,'name'=>'视图','parent'=>5),

array('id'=>17,'name'=>'基本命令','parent'=>4),

array('id'=>18,'name'=>'网络配置','parent'=>4)

);

function layer($cate,$id=0){//一棵树形成一个数组

$arr=array();

foreach($cate as $v){

if($v['parent']==$id){

$v['cate']=layer($cate,$v['id']);

$arr[]=$v;

}

}

return $arr;

}

echo '<pre>';

print_r(layer($cate));

?>