Eager instead of lazy but how about: pull all the comments in chronological order starting from the beginning and then build the tree downstream of the database as items come in?
See also the nested set representation of trees which makes it fast to get subtrees.