Traversing an Entire Tree View's Hierarchy

In a tree control it often becomes necessary to display the complete path in the tree from the selected item to the root. The path can be displayed as a string comprising of the labels of the tree items and starting from the root node to the selected item or from the selected item to the root item. The following function traverses the tree and retrieves the path from the selected item to the root.


//  GetTreeHeirarchy	 -	Retrieves the tree heirarchy as a string comprising of item 
				labels from root node to selected node
//  hTItem		 -	The HTREEITEM of selected item
//  cstrTreeHierarchy  -	String to store the Tree heirarchy
//  bTopToBottom	 -	TRUE  if the path should be from root to selected item 
				FALSE if the path should be from the selected item to the root

void CMyTreeCtrl::GetTreeHierarchy(HTREEITEM hTItem, CString &cstrTreeHierarchy, const BOOL bTopToBottom)
{
	HTREEITEM hTRootItem = GetParentItem(hTItem);
	if ( hTRootItem == NULL ){
		cstrTreeHierarchy += (GetItemText(hTItem)+"\\");
		return;
	}
	if (!bTopToBottom)
		cstrTreeHierarchy += (GetItemText(hTItem)+"\\");
	GetTreeHierarchy(hTRootItem, cstrTreeHierarchy);
	if (bTopToBottom)
		cstrTreeHierarchy += (GetItemText(hTItem)+"\\");
}
To get the tree heirarchy, this function can be called as follows:

   CString csTreeHeirarchy;
   m_pcMyTreeCtrl->GetTreeHierarchy(m_pcMyTreeCtrl->GetSelectedItem(), csTreeHeirarchy, TRUE);
		



Comments

  • Non-recursive way to traverse a TreeView ...

    Posted by Legacy on 11/27/2001 12:00am

    Originally posted by: Marco F

    If you don't like the recursive way, here is an interative algorithm to traverse a tree.
    
    

    It is not non-MFC (plain SDK), but it should be easy to convert. m_hwnd is the handle of the tree control.

    [ccode]
    TVITEM item;
    item.mask = TVIF_STATE|TVIF_PARAM;
    item.hItem = TVI_ROOT;
    HTREEITEM lastItem;

    do {
    do {
    lastItem = item.hItem;
    if (lastItem != TVI_ROOT) {
    TreeView_GetItem( m_hwnd, &item );
    // DO SOMETHING WITH YOUR TREEVIEW-ITEM (item)
    }
    } while ( (item.hItem = TreeView_GetChild( m_hwnd, lastItem )) );
    while ( (! (item.hItem = TreeView_GetNextSibling( m_hwnd, lastItem ))) && (lastItem = item.hItem = TreeView_GetParent( m_hwnd, lastItem )) ) {}
    } while ( item.hItem );
    [/ccode]

    Reply
  • Very Nice.. It is recursive function.

    Posted by Legacy on 05/04/2000 12:00am

    Originally posted by: Kim mingu

    It is recursive function..

    Idea is good

    Reply
  • Good one

    Posted by Legacy on 03/04/2000 12:00am

    Originally posted by: Siva

    A very neat one.The only string operation that could be taken care of is the leading '\' symbol. Trivial.

    Reply
  • This is cool man, great job!!

    Posted by Legacy on 12/14/1999 12:00am

    Originally posted by: Jacob C Joseph

    Great

    Reply
Leave a Comment
  • Your email address will not be published. All fields are required.

Top White Papers and Webcasts

  • Live Event Date: December 11, 2014 @ 1:00 p.m. ET / 10:00 a.m. PT Market pressures to move more quickly and develop innovative applications are forcing organizations to rethink how they develop and release applications. The combination of public clouds and physical back-end infrastructures are a means to get applications out faster. However, these hybrid solutions complicate DevOps adoption, with application delivery pipelines that span across complex hybrid cloud and non-cloud environments. Check out this …

  • Due to internal controls and regulations, the amount of long term archival data is increasing every year. Since magnetic tape does not need to be periodically operated or connected to a power source, there will be no data loss because of performance degradation due to the drive actuator. Read this white paper to learn about a series of tests that determined magnetic tape is a reliable long-term storage solution for up to 30 years.

Most Popular Programming Stories

More for Developers

RSS Feeds