You can easily render a tree many levels deep in O(n) time using a single DB que...

stephen_mcd on Nov 21, 2014 | parent | context | favorite | on: Representing Trees in PostgreSQL

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:

No need for mptt either.