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/

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-adjacency-list-trees/ http://blog.jupo.org/2010/01/26/linear-traversal-of-adjacenc... No need for mptt either.