treeview problem

I was looking for something else when coming across your questions. Here is some sample code I hope will help you, but I'm in a hurry too and cannot explain everything. To perform a query, use the Find(...) method on the Keys. Also consider method FullPath to accomplish your objective. Hope this helps some. --DdoubleD private void BuildChildKeys(TreeNode node) { for (int i = 0; i < node.Nodes.Count; i++) { string name = node.Name;// parent bool childHasChildren = node.Nodes[i].Nodes.Count != 0; if (!childHasChildren) { // Already contains the index to the data record; // Prefix with parent node information; // This node will not be a part of the 0.0.0 scheme in that the last // .0 will appear 0.0R0 instead where R0 is the record index. node.Nodes[i].Name = name + "R" + node.Nodes[i].Name; /* int ndxRecStr = node.Nodes[i].Name.IndexOf('R'); string sNdx = node.Nodes[i].Name.Substring(ndxRecStr); node.Nodes[i].Name = name + "." + i + sNdx; // parent's child */ } else node.Nodes[i].Name = name + "." + i; // parent's child BuildChildKeys(node.Nodes[i]); // is child parent too? } if (node.Nodes.Count == 0) // this item has no children (end of branch) { //node.Name += "R" + iRec; System.Diagnostics.Debug.WriteLine(node.Name); } } private void BuildKeys() { int count = treeView1.Nodes.Count; for (int i = 0; i < count; i++) { string rootIndex = Convert.ToString(i); treeView1.Nodes[i].Name = rootIndex; BuildChildKeys(treeView1.Nodes[i]); } }