php中树形结构转数组(拉平树结构,保留上下级排序)

前言

在做php中树形结构转数组的功能中有时候需要把树结构直接拉平按照树结构的顺序按照由上到下排列,这时候就需要另外一种处理方法了。

解决办法

//树结构数据转数组(拉平树结构,保留上下级排序)
    function treeToList($treeData, $pid = 0)
    {
        $array = array();
        foreach ($treeData as $val) {
            $inData = $val;
            $inData['p_key'] = $pid;
            $array[] = $inData;
            if (isset($val['children'])) {
                $children = treeToList($val['children'], $val['key']);
                if ($children) {
                    $array = array_merge($array, $children);
                }
            }
        }
        return $array;
    }

直接拉平树状结构,保留上下排序。

$tree = [
    [
        "key" => 1,
        "p_key" => 0,
        "title" => "湖北省",
        "children" => [
            [
                "key" => 2,
                "p_key" => 1,
                "title" => "武汉市",
                "children" => [
                    [
                        "key" => 3,
                        "p_key" => 2,
                        "title" => "武昌区",
                        "children" => [
                            [
                                "key" => 4,
                                "p_key" => 3,
                                "title" => "蛇山西山坡特1号",
                                "children" => [
                                    [
                                        "key" => 5,
                                        "p_key" => 4,
                                        "title" => "黄鹤楼",
                                    ],
                                ],
                            ],
                        ],
                    ],
                ],
            ],
        ],
    ],
];

$data = [
    [
        "key" => 1,
        "p_key" => 0,
        "title" => "湖北省",
    ],
    [
        "key" => 2,
        "p_key" => 1,
        "title" => "武汉市",
    ],
    [
        "key" => 3,
        "p_key" => 2,
        "title" => "武昌区",
    ],
    [
        "key" => 4,
        "p_key" => 3,
        "title" => "蛇山西山坡特1号",
    ],
    [
        "key" => 5,
        "p_key" => 4,
        "title" => "黄鹤楼",
    ],
];

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值