top | item 8643453 (no title) stephen_mcd | 11 years ago You can easily render a tree many levels deep in O(n) time using a single DB query as an adjacency list with a lookup dictionary:http://blog.jupo.org/2010/01/26/linear-traversal-of-adjacenc...No need for mptt either. discuss order hn newest No comments yet.
No comments yet.