设计树状结构货品分类状态

<?php
header('Content-Type:text/html; charset=utf-8');
$mp = array(
    'name' => '手机', 'children' => array(
        array('name' => '非智能机'),
        array('name' => '智能机', 'children' =>array(
            array('name' => '安卓机'),
            array('name' => '苹果机'),
            array('name' => 'WP机')
        ))
    )
);

$cp =array(
    'name' => '电脑', 'children' => array(
        array('name' => '电脑整机', 'children' => array(
            array('name' => '笔记本'),
            array('name' => '超极本'),
            array('name' => '游戏本')
        )),
        array('name' => '电脑配件', 'children' => array(
            array('name' => 'CPU'),
            array('name' => '主板')
        ))
    )
);

$goodsCats = array($mp, $cp);

//递归遍历$goodsCat中的所有元素
function tree($goodsCats, $deep=0){
    //1:定义一个容器装所有的分类
    static $tree = array();
    //2:定义一个变量来记录分类的级别
    ++$deep;
    foreach($goodsCats as $goodsCat){
        $treeCat = array('name' => $goodsCat['name']);  //将分类名字存放到数组中
        $treeCat['deep'] = $deep;                       //将分类级别也存放到数组中
        $tree[] = $treeCat;                             //将每次循环的分类存放起来
        //检查每个分类下是否有子分类，如果有，继续遍历
        if(isset($goodsCat['children'])){
            tree($goodsCat['children'],$deep);
        }
    }
     return $tree;
}

$treeData = tree($goodsCats);

foreach($treeData as $catData){
    echo str_repeat('------',($catData['deep']-1)).$catData['name']."<br/>";
}