/*姬昂于2004-10月添加递归算法,实现树控件的全选,反选,取消的集合操作*/
void CXmRecive::RetrievesAllSiblingTreeSetCheck(CTreeCtrl* pTreeCtrl/* = NULL */,
            HTREEITEM Item/* = NULL */,
            BOOL IsSelected/* = FALSE */,
            BOOL IsReverse/* = FALSE*/)
{
 
 if (!Item)
  return ;
 
 if (!IsReverse)
  pTreeCtrl->SetCheck(Item,IsSelected);
 else
  pTreeCtrl->SetCheck(Item,!pTreeCtrl->GetCheck(Item));
 
 RetrievesAllSiblingTreeSetCheck(pTreeCtrl,pTreeCtrl->GetChildItem(Item),IsSelected,IsReverse);
 
 RetrievesAllSiblingTreeSetCheck(pTreeCtrl,pTreeCtrl->GetNextSiblingItem(Item),IsSelected,IsReverse);
}

好夸张哦~~~看不懂，要注释……

void CXmRecive::RetrievesAllSiblingTreeSetCheck(CTreeCtrl* pTreeCtrl,HTREEITEM Item,BOOL IsSelected,BOOL IsReverse) { if (!Item)//是否为树节点，非则返回树的上一（父或兄弟）节点

return ; if (!IsReverse) //该树节点是否被选中过》 pTreeCtrl->SetCheck(Item,IsSelected); else pTreeCtrl->SetCheck(Item,!pTreeCtrl->GetCheck(Item)); RetrievesAllSiblingTreeSetCheck(pTreeCtrl,pTreeCtrl->GetChildItem(Item),IsSelected,IsReverse);//选找该节点的Child节点 RetrievesAllSiblingTreeSetCheck(pTreeCtrl,pTreeCtrl->GetNextSiblingItem(Item),IsSelected,IsReverse););//选找该节点的NextSibling节点 }

这是典型的递归算法，用的前序便历。详细可看一些数据结构方面的书