MFC CTreeCtrl 递归遍历算法

递归遍历

 1 void Traverse(HTREEITEM hTree)
 2 {
 3     if (!hTree)
 4     {
 5         return;
 6     }
 7 
 8     //Do Something.
 9 
10     //Traverse Child Node
11     HTREEITEM hChild = GetChildItem(hTree);
12     Traverse(hChild);
13 
14     //Traverse Sibling Node
15     HTREEITEM hSibling = GetNextSiblingItem(hTree);
16     Traverse(hSibling);
17 }

循环遍历

 

posted @ 2019-10-25 14:10  余生以学  阅读(540)  评论(0)  编辑  收藏  举报