无限级分类引用传值方式实现

无限级分类引用传值方式实现

---

<?php

$data[1] = array('id'=>'1','name'=>'一级目录A','pid'=>'0','sort'=>'1');
$data[2] = array('id'=>'2','name'=>'一级目录B','pid'=>'0','sort'=>'2');
$data[3] = array('id'=>'3','name'=>'一级目录C','pid'=>'0','sort'=>'3');
$data[4] = array('id'=>'4','name'=>'一级目录D','pid'=>'0','sort'=>'4');
$data[5] = array('id'=>'5','name'=>'二级目录A-1','pid'=>'1','sort'=>'1');
$data[6] = array('id'=>'6','name'=>'二级目录A-2','pid'=>'1','sort'=>'2');
$data[7] = array('id'=>'7','name'=>'二级目录A-3','pid'=>'1','sort'=>'3');
$data[8] = array('id'=>'8','name'=>'二级目录B-1','pid'=>'2','sort'=>'1');
$data[9] = array('id'=>'9','name'=>'二级目录B-2','pid'=>'2','sort'=>'2');
$data[10] = array('id'=>'10','name'=>'二级目录B-3','pid'=>'2','sort'=>'3');
$data[11] = array('id'=>'11','name'=>'二级目录C-1','pid'=>'3','sort'=>'2');
$data[12] = array('id'=>'12','name'=>'二级目录D-1','pid'=>'4','sort'=>'1');
$data[13] = array('id'=>'13','name'=>'二级目录D-2','pid'=>'4','sort'=>'2');
$data[14] = array('id'=>'14','name'=>'三级目录A-2-1','pid'=>'6','sort'=>'1');
$data[15] = array('id'=>'15','name'=>'三级目录A-2-2','pid'=>'6','sort'=>'2');
$data[16] = array('id'=>'16','name'=>'三级目录C-1-1','pid'=>'11','sort'=>'1');
$data[17] = array('id'=>'17','name'=>'三级目录B-2-1','pid'=>'9','sort'=>'2');

/**
 * 无限极分类-引用传值的方式
 *
 *先把根节点挂载出来  每次循环的时候用引用传值把当前循环的数据挂载在相应的父级数组上。
 *由于引用传值的特征不用考虑父级和再上级的层级关系 
 *
 * 
 * @param  [type] $data [description]
 * @return [type]       [description]
 */
function tree($data)
{
    $res = [];
    $i =1;
    foreach ($data as $key => $value) {
        echo "\n第{$i}次\n"; 
        var_dump(isset($data[$value['pid']]));
        if (isset($data[$value['pid']])) {
            $data[$value['pid']]['child'][] = &$data[$key];
            var_dump($data);
            echo "\n";
        }else{
            $res[] = &$data[$key];
            var_dump($res);
            echo "\n"; 
        }
        $i++;
    }
    return $res;
}
echo "<pre>";
$tree = [];
var_dump(tree($data));