php 递归生成树状数组,一段php树状数组 如何简化

下面是一段非常复杂的树状数组

如何提取所有的[name]值, 按倒序简化保存到一个一维数组

Array

(

[0] => Array

(

[id] => 1

[pid] =>

[name] => admin

[children] => Array

(

[0] => Array

(

[id] => 58

[pid] => 1

[name] => 000c

[children] => Array

(

[0] => Array

(

[id] => 72

[pid] => 58

[name] => 000c1

[children] => Array

(

[0] => Array

(

[id] => 93

[pid] => 72

[name] => 000c11

)

[1] => Array

(

[id] => 96

[pid] => 72

[name] => 000c12

)

)

)

[1] => Array

(

[id] => 81

[pid] => 58

[name] => 000c2

[children] => Array

(

[0] => Array

(

[id] => 99

[pid] => 81

[name] => 000c21

)

[1] => Array

(

[id] => 101

[pid] => 81

[name] => 000C22

)

)

)

[2] => Array

(

[id] => 87

[pid] => 58

[name] => 000c3

[children] => Array

(

[0] => Array

(

[id] => 104

[pid] => 87

[name] => 000C31

)

[1] => Array

(

[id] => 108

[pid] => 87

[name] => 000C32

)

)

)

)

)

[1] => Array

(

[id] => 44

[pid] => 1

[name] => ???

)

[2] => Array

(

[id] => 45

[pid] => 1

[name] => ??

)

[3] => Array

(

[id] => 46

[pid] => 1

[name] => ??

)

[4] => Array

(

[id] => 49

[pid] => 1

[name] => only

)

[5] => Array

(

[id] => 52

[pid] => 1

[name] => 007?

)

[6] => Array

(

[id] => 53

[pid] => 1

[name] => 0001e

[children] => Array

(

[0] => Array

(

[id] => 54

[pid] => 53

[name] => 000e1

[children] => Array

(

[0] => Array

(

[id] => 130

[pid] => 54

[name] => 000e11

)

[1] => Array

(

[id] => 131

[pid] => 54

[name] => 000e12

)

)

)

[1] => Array

(

[id] => 73

[pid] => 53

[name] => 000e2

[children] => Array

(

[0] => Array

(

[id] => 125

[pid] => 73

[name] => 000e21

[children] => Array

(

[0] => Array

(

[id] => 154

[pid] => 125

[name] => gfhgfhgf

)

[1] => Array

(

[id] => 155

[pid] => 125

[name] => hgfhgf

)

[2] => Array

(

[id] => 156

[pid] => 125

[name] => fghfgh

[children] => Array

(

[0] => Array

(

[id] => 157

[pid] => 156

[name] => fghfghf

)

[1] => Array

(

[id] => 158

[pid] => 156

[name] => hgfghff

)

[2] => Array

(

[id] => 159

[pid] => 156

[name] => rygfgfg

)

[3] => Array

(

[id] => 160

[pid] => 156

[name] => dgdfgd

[children] => Array

(

[0] => Array

(

[id] => 161

[pid] => 160

[name] => ghgjhgjh

)

[1] => Array

(

[id] => 162

[pid] => 160

[name] => ghfhgfhgf

)

[2] => Array

(

[id] => 163

[pid] => 160

[name] => ghfhgfgh

)

)

)

)

)

[3] => Array

(

[id] => 164

[pid] => 125

[name] => 000e211

)

)

)

[1] => Array

(

[id] => 126

[pid] => 73

[name] => 000e22

[children] => Array

(

[0] => Array

(

[id] => 136

[pid] => 126

[name] => rtyrtyrtyr

)

[1] => Array

(

[id] => 137

[pid] => 126

[name] => fghfghfhgf

)

[2] => Array

(

[id] => 138

[pid] => 126

[name] => fdgfdgfd

)

[3] => Array

(

[id] => 139

[pid] => 126

[name] => dfdgfd

)

[4] => Array

(

[id] => 140

[pid] => 126

[name] => fghfhgfg

)

[5] => Array

(

[id] => 141

[pid] => 126

[name] => hgfhgfhf

)

[6] => Array

(

[id] => 142

[pid] => 126

[name] => gfhfghfhgf

)

[7] => Array

(

[id] => 143

[pid] => 126

[name] => ghfghff

)

[8] => Array

(

[id] => 144

[pid] => 126

[name] => fghfhgf

)

)

)

)

)

)

)

)

)

)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值