Click here to Skip to main content
Click here to Skip to main content

ASP.NET TreeView Sort

, 11 Sep 2011 CPOL
Rate this:
Please Sign up or sign in to vote.
Easy way to sort nodes in a TreeView using a recursive function.
A few days ago, I needed to sort the nodes of a tree view. The solutions that I found over the Internet did not please me, so I decided to write my own. This solution is a simple recursive function that sorts tree nodes in an alphabetic order.

Create your tree view and add your nodes:

TreeView mytree = new TreeView();
//add your nodes here

Then simply call the sort function with the main node as the argument:


Here is the recursive function:

private void sort(TreeNode node)
    foreach (TreeNode n in node.ChildNodes)
        TreeNode temp = null;
        List<TreeNode> childs = new List<TreeNode>();
            foreach (TreeNode n in node.ChildNodes)
                if (temp == null || n.Text[0] < temp.Text[0])
                    temp = n;
            temp = null;
        foreach (TreeNode a in childs)
    catch { }


This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)


About the Author

Software Developer (Senior) Martifer Inovação e Gestão
Portugal Portugal
No Biography provided

Comments and Discussions

Questionincorrect comparison PinmemberMember 1024692319-Nov-14 4:04 
Suggestioncompare full words PinmemberKlimovec12-Apr-12 3:49 
GeneralHeyy it worked for me. Currently i have a treeview which pop... Pinmemberrjkumar19879-Jan-12 3:27 
GeneralRe: just replace the logical comparison "n.Text[0] < temp.Text[0... Pinmemberbrunofer200715-Jan-12 0:59 
General1-The datasource should be sort not the tree in An... PinmemberJoePatent13-Sep-11 9:03 
1-The datasource should be sort not the tree in And then you fill the tree...
2- recursive function should always be avoid in prod development. This could be the source of instability. You can't predict the number of iteration and consequently the resources that will be required to run your routine.
3- foreach (TreeNode n in node.ChildNodes)
if (temp == null || n.Text[0] < temp.Text[0])
temp = n;
This need explanation. As soon as your temp is null you should not even execute your for each loop. That's a waste of time.
4-Also, there is already existing sort algorithm to accomplish this without having to code yourself an average one like this one based on bubble sort algo.
GeneralRe: 1 - Sometimes a TreeView doesn't have necessarily a datasour... Pinmemberbrunofer200714-Sep-11 1:36 
GeneralCould I ask, why can't you use the default TreeView Sort met... PinmemberGeorge Swan11-Sep-11 21:11 
GeneralRe: Hello George, as you can see in the title, this solution is ... Pinmemberbrunofer200711-Sep-11 23:21 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

| Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.150129.1 | Last Updated 11 Sep 2011
Article Copyright 2011 by brunofer2007
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid