本文實例為大家分享了PHP遞歸實現(xiàn)層級樹狀展開的主要代碼，供大家參考，具體內(nèi)容如下

效果圖：

實現(xiàn)代碼：

<?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'],  

  ); 

} 

// 將數(shù)據(jù)按照縮進簡單排列 見圖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/>'; 

// 將數(shù)據(jù)按照所屬關系封裝 見圖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/>'; 

// 將數(shù)據(jù)使用HTML再次展現(xiàn) 見圖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);

以上就是本文的全部內(nèi)容，希望對大家學習php程序設計有所幫助。