Traversing a tree structure using recursion

Question

I am dealing with one table on the database. The columns are: id, name, parent_id, hasChildren. (parent_id would be an id on the table. if parent_id is null, the record is a parent.)

What would be the best way to loop through this data so I can add it to a list like:

- item1
- item2
>> item 2.1
>>>> item 2.1.1
>> item 2.2
- item3

etc etc.

edit - when i say "list" i mean like a listbox

edit2 - woops, yes, list needs to be sorted by parent record alphabetically. i'm using mssql.

is the Tree sorted? does the order need to be kept to the list? — amit, Mar 17 '11 at 11:47
What DB are you using? Oracle for example supports tree dependency queries directly ... — Jan Zyka, Mar 17 '11 at 11:47

score 0 · Answer 1 · edited May 23 '17 at 12:04

0

SQL Server 2008 allows you to define hierarchies in a table:

You could also use a recursive CTE:

Determine the hierarchy of records in a SQL database

edited May 23 '17 at 12:04

Community

1
1

answered Mar 17 '11 at 12:11

Johann Blais

9,389
6
45
65

Traversing a tree structure using recursion

1 Answers1

Linked