柴门鸟雀噪，归客千里至。光明顶下来，一路听着阵阵松涛，我们走过西海，飞来石，天海，爬过百步云梯，伴着凤凰松迎客松的多姿到了玉屏峰。玉屏峰犹如一道屏障，山面光滑如镜子，如屏风，还不时有几个斗大的字，说是哪位名人留下的。玉屏峰最险的地方是在一线天，上下达七八十度的落差，台阶狭，仅容一人，台阶窄，仅托一足，百米长，走多了，腿便打抖了，害怕了，还不时地叫着好刺激呀。
本文实例为大家分享了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'],
);
}
// 将数据按照缩进简单排列 见图1
function data2arr($tree, $rootId = 0, $level = 0) {
foreach($tree as $leaf) {
if($leaf['fid'] == $rootId) {
echo str_repeat('', $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/>';
// 将数据按照所属关系封装 见图2
function 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再次展现 见图3
function tree2html($tree) {
echo '<ul>';
foreach($tree as $leaf) {
echo '<li>' .$leaf['name'];
if(! emptyempty($leaf['children'])) tree2html($leaf['children']);
echo '</li>';
}
echo '</ul>';
}
tree2html($tree);
以上就是本文的全部内容，希望对大家学习php程序设计有所帮助。
