";
//print_r($tree);
//echo "";
function beautifulTree($arr, $l = '-|')
{
static $l = '';
static $str = '';
//遍历刚才得到的目录树
foreach($arr as $key=>$val) {
//如果是个数组，也就代表它是个目录，那么就在它的子文件中加入-|来表示是下一级吧
if(is_array($arr[$key])) {
$str.=$l.$key."
";
$l.='-|';
beautifulTree($arr[$key], $l);
}else {
$str.=$l.$val."
";
}
}
$l = '';
return $str;
}
$beautifulTree = beautifulTree($tree);
echo "";
print_r($beautifulTree);
echo "
";
?>