PHP 递归实现层级树状展现数据
<?php$db = mysql_connect('localhost', 'root', 'root') or die('Can\'t connect to database');mysql_select_db('test') or die('Can\'t find database : test');$result = mysql_query('select id, fid, name from tree');while($arr = mysql_fetch_array($result)){ $data[] = array( 'id' => $arr['id'], 'fid' => $arr['fid'], 'name' => $arr['name'], );}// 将数据按照缩进简单排列 见图1function data2arr($tree, $rootId = 0, $level = 0) { foreach($tree as $leaf) { if($leaf['fid'] == $rootId) { echo str_repeat('&nbsp;&nbsp;&nbsp;&nbsp;', $level) . $leaf['id'] . ' ' . $leaf['name'] . '<br/>'; foreach($tree as $l) { if($l['fid'] == $leaf['id']) { data2arr($tree, $leaf['id'], $level + 1); break; } } } }}data2arr($data);echo '<br/>-----------------------------------------------------------------------<br/>';// 将数据按照所属关系封装 见图2function arr2tree($tree, $rootId = 0) { $return = array(); foreach($tree as $leaf) { if($leaf['fid'] == $rootId) { foreach($tree as $subleaf) { if($subleaf['fid'] == $leaf['id']) { $leaf['children'] = arr2tree($tree, $leaf['id']); break; } } $return[] = $leaf; } } return $return;}$tree = arr2tree($data);print_r($tree);echo '<br/>-----------------------------------------------------------------------<br/>';// 将数据使用HTML再次展现 见图3function tree2html($tree) { echo '<ul>'; foreach($tree as $leaf) { echo '<li>' .$leaf['name']; if(! empty($leaf['children'])) tree2html($leaf['children']); echo '</li>'; } echo '</ul>';}tree2html($tree);
图 1：
http://dl.iteye.com/upload/attachment/0069/3564/f472e607-6535-3c50-9160-bcda27c38902.png
图 2：
http://dl.iteye.com/upload/attachment/0069/3566/0e9a969c-3c23-3707-83bd-dd4fd6d673fe.png
图 3：
http://dl.iteye.com/upload/attachment/0069/3568/465c069c-3b15-3a7d-8146-d4cba79c0f86.png
页:
[1]