<span>/*</span><span>*
* 创建父节点树形数组
* 参数
* $ar 数组，邻接列表方式组织的数据
* $id 数组中作为主键的下标或关联键名
* $pid 数组中作为父键的下标或关联键名
* 返回 多维数组
*</span><span>*/</span><span>function</span> find_parent(<span>$ar</span>, <span>$id</span>='id', <span>$pid</span>='pid'<span>) {
</span><span>foreach</span>(<span>$ar</span><span>as</span><span>$v</span>) <span>$t</span>[<span>$v</span>[<span>$id</span>]] = <span>$v</span><span>;
</span><span>foreach</span> (<span>$t</span><span>as</span><span>$k</span> => <span>$item</span><span>){
</span><span>if</span>( <span>$item</span>[<span>$pid</span><span>] ){
</span><span>if</span>( ! <span>isset</span>(<span>$t</span>[<span>$item</span>[<span>$pid</span>]]['parent'][<span>$item</span>[<span>$pid</span><span>]]) )
</span><span>$t</span>[<span>$item</span>[<span>$id</span>]]['parent'][<span>$item</span>[<span>$pid</span>]] =& <span>$t</span>[<span>$item</span>[<span>$pid</span><span>]];
}
}
</span><span>return</span><span>$t</span><span>;
}
</span><span>/*</span><span>*
* 创建子节点树形数组
* 参数
* $ar 数组，邻接列表方式组织的数据
* $id 数组中作为主键的下标或关联键名
* $pid 数组中作为父键的下标或关联键名
* 返回 多维数组
*</span><span>*/</span><span>function</span> find_child(<span>$ar</span>, <span>$id</span>='id', <span>$pid</span>='pid'<span>) {
</span><span>foreach</span>(<span>$ar</span><span>as</span><span>$v</span>) <span>$t</span>[<span>$v</span>[<span>$id</span>]] = <span>$v</span><span>;
</span><span>foreach</span> (<span>$t</span><span>as</span><span>$k</span> => <span>$item</span><span>){
</span><span>if</span>( <span>$item</span>[<span>$pid</span><span>] ) {
</span><span>$t</span>[<span>$item</span>[<span>$pid</span>]]['child'][<span>$item</span>[<span>$id</span>]] =& <span>$t</span>[<span>$k</span><span>];
}
}
</span><span>return</span><span>$t</span><span>;
}
</span><span>$data</span> = <span>array</span><span>(
</span><span>array</span>('ID'=>1, 'PARENT'=>0, 'NAME'=>'祖父'),
<span>array</span>('ID'=>2, 'PARENT'=>1, 'NAME'=>'父亲'),
<span>array</span>('ID'=>3, 'PARENT'=>1, 'NAME'=>'叔伯'),
<span>array</span>('ID'=>4, 'PARENT'=>2, 'NAME'=>'自己'),
<span>array</span>('ID'=>5, 'PARENT'=>4, 'NAME'=>'儿子'),<span> );
</span><span>$p</span> = find_parent(<span>$data</span>, 'ID', 'PARENT'<span>);
</span><span>$c</span> = find_child(<span>$data</span>, 'ID', 'PARENT'<span>);
</span><span>Print_r</span> (<span>$c</span>);登录后复制
执行效果:
<span>Array</span><span>(
[</span>1] => <span>Array</span><span> (
[ID] </span>=> 1<span> [PARENT] </span>=> 0<span> [NAME] </span>=><span> 祖父
[child] </span>=> <span>Array</span><span> (
[</span>2] => <span>Array</span><span> (
[ID] </span>=> 2<span> [PARENT] </span>=> 1<span> [NAME] </span>=><span> 父亲
[child] </span>=> <span>Array</span><span> (
[</span>4] => <span>Array</span><span> (
[ID] </span>=> 4<span> [PARENT] </span>=> 2<span> [NAME] </span>=><span> 自己
[child] </span>=> <span>Array</span><span> (
[</span>5] => <span>Array</span><span> (
[ID] </span>=> 5<span> [PARENT] </span>=> 4<span> [NAME] </span>=><span> 儿子
)
)
)
)
)
[</span>3] => <span>Array</span><span> (
[ID] </span>=> 3<span> [PARENT] </span>=> 1<span> [NAME] </span>=><span> 叔伯
)
)
)
[</span>2] => <span>Array</span><span> (
[ID] </span>=> 2<span> [PARENT] </span>=> 1<span> [NAME] </span>=><span> 父亲
[child] </span>=> <span>Array</span><span> (
[</span>4] => <span>Array</span><span> (
[ID] </span>=> 4<span> [PARENT] </span>=> 2<span> [NAME] </span>=><span> 自己
[child] </span>=> <span>Array</span><span> (
[</span>5] => <span>Array</span><span> (
[ID] </span>=> 5<span> [PARENT] </span>=> 4<span> [NAME] </span>=><span> 儿子
)
)
)
)
)
[</span>3] => <span>Array</span><span> (
[ID] </span>=> 3<span> [PARENT] </span>=> 1<span> [NAME] </span>=><span> 叔伯
)
[</span>4] => <span>Array</span><span> (
[ID] </span>=> 4<span> [PARENT] </span>=> 2<span> [NAME] </span>=><span> 自己
[child] </span>=> <span>Array</span><span> (
[</span>5] => <span>Array</span><span> (
[ID] </span>=> 5<span> [PARENT] </span>=> 4<span> [NAME] </span>=><span> 儿子
)
)
)
[</span>5] => <span>Array</span><span> (
[ID] </span>=> 5<span> [PARENT] </span>=> 4<span> [NAME] </span>=><span> 儿子
)
)</span>登录后复制
以上就介绍了php递归算法 PHP树-不需要递归，包括了php递归算法方面的内容，希望对PHP教程有兴趣的朋友有所帮助。
