无限极

function getTree($data, $pId)
{
   $tree = [];
   foreach($data as $k => $v)
   {
      if($v['parent'] == $pId)
      {         //父亲找到儿子
         $v['parent'] = $this->getTree($data, $v['id']);
         $tree[] = $v;
         //unset($data[$k]);
      }
   }
   return $tree;
}

展示：

function procHtml($tree)
{
   $html = '';
   foreach($tree as $t)
   {
      if($t['parent'] == '' || $t['parent'] ==0)
      {
         $html .= "<li>".$t['id']."</li>";
      }
      else
      {
         $html .= "<li>".$t['name'];
         $html .= procHtml($t['parent']);
         $html = $html."</li>";
      }
   }
   return $html ? '<ul>'.$html.'</ul>' : $html ;
}
echo procHtml($tree);