/** 
 * 按ID條件從評論數(shù)組中遞歸查找 
 * 
 */ 
function getCommentsFromAryById($commtAry, $id) 
{ 
 if ( !is_array($commtAry) ) return FALSE; 
 foreach($commtAry as $key=>$value) { 
  if ( $value['id'] == $id ) return $value; 
  if ( isset($value['children']) && is_array($children) ) $this->getCommentsFormAryById($value['children'], $id); 
 } 
} 
/** 
 * 追加 子評論 到 主評論 中，并形成children子項 
 * 
 * @param array $commtAry 原評論數(shù)據(jù)引用 
 * @param int $parentId 主評論ID 
 * @param array $childrenAry 子評論的值 
 */ 
function addChildenToCommentsAry($commtAry, $parentId, $childrenAry) 
{ 
 if ( !is_array($commtAry) ) return FALSE; 
 
 foreach($commtAry as $key=>$value) { 
  if ( $value['id'] == $parentId ) { 
   $commtAry[$key]['children'][] = $childrenAry; 
   return TRUE; 
  } 
  if ( isset($value['children']) ) $this->addChildenToCommentsAry($commtAry[$key]['children'], $parentId, $childrenAry); 
 } 
} 
 $result = $this->BBDM->select($table, $column, $condition, 0, 1000); 
 
 /* 開始進行嵌套評論結(jié)構(gòu)重組 */ 
 array_shift($result); 
 $count = count($result); 
 $i  = 0; 
 while( $i<$count ) { 
  if ( '0' != $result[$i]['parentId'] ) { 
   $this->addChildenToCommentsAry($result, $result[$i]['parentId'], $result[$i]); 
   unset($result[$i]); 
  } 
  $i++; 
 } 
 $result = array_values($result); 
 /* 重組結(jié)束 */ 

<?php
$comments = array (
  array (
    'id' => '3',
    'parent' => '0'
  ),
  array (
    'id' => '9',
    'parent' => '0'
  ),
  array (
    'id' => '1',
    'parent' => '3'
  ),
  array (
    'id' => '2',
    'parent' => '3'
  ),
  array (
    'id' => '5',
    'parent' => '1'
  ),
  array (
    'id' => '7',
    'parent' => '1'
  )
);
function html5_comment($comment) {
  echo '<li>';
  echo 'id:', $comment['id'], ' parent:', $comment['parent'];
}
function start_el(& $output, $comment) {
  ob_start();
  html5_comment($comment);
  $output .= ob_get_clean();
}
function end_el(& $output) {
  $output .= "</li><!-- #comment-## -->\n";
}
function start_lvl(& $output) {
  $output .= '<ol class="children">' . "\n";
}
function end_lvl(& $output) {
  $output .= "</ol><!-- .children -->\n";
}
function display_element($e, & $children_elements, $max_depth, $depth, & $output) {
  $id = $e['id'];
  start_el($output, $e); //當前評論的開始代碼
  if ($max_depth > $depth +1 && isset ($children_elements[$id])) { //如果沒超過最大層，并且存在子元素數(shù)組
    foreach ($children_elements[$id] as $child) {
      if (!isset ($newlevel)) { //第一次循環(huán)沒設(shè)置變量$newlevel，所以把$newlevel設(shè)為true，并且開始子元素的開始代碼;第二次及之后的循環(huán)，已經(jīng)設(shè)置了$newlevel,就不會再添加子元素的開始代碼。因為同一批循環(huán)時兄弟元素，所以只需要一個子元素開始代碼，循環(huán)內(nèi)容為并列關(guān)系。
        $newlevel = true;
        start_lvl($output);
      }
      display_element_template($child, $children_elements, $max_depth, $depth +1, $output); //$child作為參數(shù)，繼續(xù)去尋找下級元素
    }
    unset ($children_elements[$id]); //用完釋放變量，以后就不會重復(fù)判斷該值了,遞歸后繼續(xù)判斷剩下的子元素
  }
  if (isset ($newlevel) && $newlevel) { //如果前面找到了子元素，這里就要執(zhí)行子元素的結(jié)束代碼
    end_lvl($output);
  }
  end_el($output); //當前評論的結(jié)束代碼
}
function display_element_template($e, & $children_elements, $max_depth, $depth, & $output) {
  $id = $e['id'];
  display_element($e, $children_elements, $max_depth, $depth, $output);
  if ($max_depth <= $depth +1 && isset ($children_elements[$id])) { //如果超出最大層級，并且子元素存在的話，以$child為參數(shù)繼續(xù)往下找
    foreach ($children_elements[$id] as $child) {
      display_element_template($child, $children_elements, $max_depth, $depth, $output);
    }
    unset ($children_elements[$id]); //用完釋放變量
  }
}
function comments_list($comments) {
  $top_level_elements = array ();
  $children_elements = array ();
  foreach ($comments as $e) {
    if (0 == $e['parent']) {
      $top_level_elements[] = $e;
    } else {
      $children_elements[$e['parent']][] = $e;
    }
  }
  $output = '';
  foreach ($top_level_elements as $e) {
    display_element_template($e, $children_elements, 2, 0, $output);
  }
  //var_dump($children_elements);//由于每次用完$children_elements后都會釋放變量，所以到最后$children_elements為空數(shù)組
  return $output;
}
echo '<ol class="comment-list">', comments_list($comments), '</ol>';