If the two items are displayed in order, why not just retrieve them
that way, i.e, add Order by [parent][name]  to the Sql.

Then process the record set from top down, tracking when the parent
value changes tells you when indent a record a level or keep it at the
top level.

Maybe I missed something, seems a lot easier and faster than doing a
recursive search.

    Cordially,
    Bob Moss

The best way I can think of doing this is by writing some sort of
recursive routine to search the database for the parent and name
fields any "name" can only have one parent and hence is unique, but a
"parent" can have many children.

E.g Search database for "name" where "parent" = ""  - make this the
root node called "name".
Then search database for "name" where "parent" = name of root node -
make these children of the root node....etc etc

Any help would be most appreciated. Thanks.

Sub AddChildren(Name As String)
    Dim NewSearch As Recordset
     Dim NewNode As Node
    Dim SQL As String, ParentOD As String, NewName As String
    Dim I As Integer

    SQL = "SELECT * FROM OD WHERE Owning_OD = '" & Name & "'"
    Set NewSearch = Dbs.OpenRecordset(SQL, dbOpenDynaset)
    If NewSearch.RecordCount = 0 Then
    'Exit Sub
    Else
    NewSearch.MoveNext
    Do While Not NewSearch.EOF
    ParentOD = NewSearch!OWNING_OD
    NewName = NewSearch!OD_NAME
    Set NewNode = Treeview1.Nodes.Add(ParentOD, tvwChild, NewName,
NewName, "node")
    NewNode.ExpandedImage = "open"
    AddChildren (NewName)
    NewSearch.MoveNext
    Loop
    End If
End Sub

Thanks if you were working on it.

    Db.Execute ("DELETE * FROM [Dummy Tree]")
    Set Dt = Db.OpenTable("Dummy Tree")
    Dt.AddNew
    Dt("Child_ID") = ID
    Dt("Parent_ID") = 0
    Dt.Update
    Dt.MoveLast
    Do Until Dt.EOF
      Db.Execute( "INSERT INTO [Dummy Tree] Parent_ID, Child_ID SELECT
         DISTINCTROW " & Dt("Child_ID") & " AS EXPR1, Child_ID  FROM Group
         WHERE Parent_ID =" & Dt("Child_ID"))  
     Dt.MoveNext      
     Loop    
     Dt.Close

Antti Kilpinen