If you want to find an item in a tree control (CTreeCtrl from MFC) by its name you need a recursive function. Below is a function that does that. How does it work: you pass the text of the item to search, the tree reference and an item in the tree. The function will search through the sub-tree of that item for a match. If it finds it, it returns the tree item, otherwise NULL. To search the entire tree, pass the root of the tree. If your tree has more than just one root and you want to search the entire tree, you’d have to call it once for each root item.<\/p>\n
\r\n\/\/ name - the name of the item that is searched for\r\n\/\/ tree - a reference to the tree control\r\n\/\/ hRoot - the handle to the item where the search begins\r\nHTREEITEM FindItem(const CString& name, CTreeCtrl& tree, HTREEITEM hRoot)\r\n{\r\n\t\/\/ check whether the current item is the searched one\r\n\tCString text = tree.GetItemText(hRoot);\r\n\tif (text.Compare(name) == 0)\r\n\t\treturn hRoot; \r\n\r\n\t\/\/ get a handle to the first child item\r\n\tHTREEITEM hSub = tree.GetChildItem(hRoot);\r\n\t\/\/ iterate as long a new item is found\r\n\twhile (hSub)\r\n\t{\r\n\t\t\/\/ check the children of the current item\r\n\t\tHTREEITEM hFound = FindItem(name, tree, hSub);\r\n\t\tif (hFound)\r\n\t\t\treturn hFound; \r\n\r\n\t\t\/\/ get the next sibling of the current item\r\n\t\thSub = tree.GetNextSiblingItem(hSub);\r\n\t} \r\n\r\n\t\/\/ return NULL if nothing was found\r\n\treturn NULL;\r\n}<\/pre>\n[Update]
\nTo search the entire tree you can use this helper function, which will work regardless how many roots the tree has.<\/p>\n
\r\nHTREEITEM CTreeDemoDlg::FindItem(const CString& name, CTreeCtrl& tree)\r\n{\r\n HTREEITEM root = m_tree.GetRootItem();\r\n while(root != NULL)\r\n {\r\n HTREEITEM hFound = FindItem(name, tree, root);\r\n if (hFound)\r\n return hFound; \r\n\r\n root = tree.GetNextSiblingItem(root);\r\n }\r\n\r\n return NULL;\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"If you want to find an item in a tree control (CTreeCtrl from MFC) by its name you need a recursive function. Below is a function that does that. How does it work: you pass the text of the item to search, the tree reference and an item in the tree. The function will search … Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_uag_custom_page_level_css":"","advgb_blocks_editor_width":"","advgb_blocks_columns_visual_guide":"","_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[12],"tags":[],"class_list":["post-54","post","type-post","status-publish","format-standard","hentry","category-mfc"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t