Click here to Skip to main content
12,511,383 members (131,993 online)
Click here to Skip to main content
Articles » Database » Database » SQL » Downloads


30 bookmarked

Depth-wise Ordering for Trees in SQL

, 7 Jun 2007 CPOL
Using a modified Adjacency List model in SQL, can you retrieve a depth-wise ordered subtree?
No downloads associated with this content

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.


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


About the Author

Adam Hurwitz
United States United States
My blog:

You may also be interested in...

| Advertise | Privacy | Terms of Use | Mobile
Web01 | 2.8.160929.1 | Last Updated 7 Jun 2007
Article Copyright 2007 by Adam Hurwitz
Everything else Copyright © CodeProject, 1999-2016
Layout: fixed | fluid