父类查询子类
//递归 父类查询子类
function getTree($data, $pId)
{
$tree = '';
foreach($data as $k => $v)
{
if($v['tuiid'] == $pId)
{ //父亲找到儿子
$v['arr'] = getTree($data, $v['user_login']);
$tree[] = $v;
//unset($data[$k]);
}
}
return $tree;
}
//递归 父类统计子数值
function getTreeNum($pId)
{
//数据存储
$data = S('userlist');
if (empty($userlist)) {
$data = M('users')->where(array('user_status'=>1,'user_type'=>2))->select();
S('userlist',$data,7200);# code...
}
$tree['num'] ='';
$tree['score'] ='';
$tree['arr'] = '';
foreach($data as $k => $v)
{
if($v['tuiid'] == $pId)
{ //父亲找到儿子
$v['arr'] = getTree($data, $v['user_login']);
$tree['arr'][] = $v;
$tree['num'] +=1;
$tree['score'] +=$v['benjin'];
//unset($data[$k]);
}
}
return $tree;
}
