Treeviews are comonly used in many websites where different categories are required to display. A Tree structure may have n levels. This is why, a suitable piece of code may be required, that enables the binding upto n levels. Another example may be a directory structure like we have in windows.
This chunk of code is efficient in a sense that it uses recursion. I have seen some snippets of code around internet where they include one or more columns in the database to correctly populate the treeview.
We define a recursive method as a method that calls it self until a certain condition becomes true. For example:
The code above calculates the factorial of a number for example: factorial of 3 is 3 * 2 * 1. More information on recursion can be found here : Recursion
Using the code
Categories are generally designed in a unique manner, where one category has exactly one parent and one or more children. Thus we design our table with three columns that is NodeID, ParentID and NodeText where 'Node' stands for a category. '-1' can be choosen act as a ParentID for the root level Nodes. All other nodes having ParentID other than '-1' will exist under Root Level Nodes under their specific Parent Nodes.
Here is the code that I am using to populate the tree.
It includes a recusive function, that adds the nodes to n levels. The function GetData() is simply returning the child nodes of a parent node. You can use it like a select query or you can read all categories in the database at once and can make this function iterate on rows as I am doing for this sample code with ReadData().
The above code will produce the following treeview:
Points of Interest
One can also use XML to store the data. In that case data will be read in a dataset or using a parsing mechanism depending upon the requirements. Remember that we have post back properties for the treeview control, so you will be able to navigate user to the required pages when a particular node is clicked.