本文共 427 字,大约阅读时间需要 1 分钟。
//遍历CTreeCtrl 二叉树void main(){ HTREEITEM hRoot; CTreeCtrl tree.GetRootItem();//根节点 SearchTree(tree,hRoot);}void SearchTree(CTreeCtrl& tree, HTREEITEM hItem){ HTREEITEM hCurItem = tree.GetChildItem(hItem);//获得第一个节点 HTREEITEM hNextItem; while(hCurItem) { hNextItem = hCurItem; SearchTree(tree, hNextItem); if (!tree.GetChildItem(hCurItem)) { //可以对没有子目录的节点进行操作(hCurItem) } hCurItem = tree.GetNextSiblingItem(hCurItem); } }
转载地址:http://qajub.baihongyu.com/