无限极分类函数

function node_merge($node, $access = null, $pid = 0){

    $arr = array();

  foreach ($node as $v) {

    if (is_array($access)) {

      $v['access'] = in_array($v['id'], $access) ? 1 : 0;

    }

    if ($v['pid'] == $pid) {

      $v['child'] = node_merge($node, $access, $v['id']);

      $arr[] = $v;

    }

  }

  return $arr;

}

 
原文地址:https://www.cnblogs.com/feiqi/p/4504493.html