Hi Cetin

>I don't remember if I suggested you to read and download sample from June 2001 UT magazine. In that it shows a fast way of loading a tree fast (on demand loading rather than load all nodes).

I don't remember whose code I have borrowed but it was in one of the TV sample links, this has a SQL cursor based tree for few levels of nodes, rest are called into the cursor as and when required. But I will check out this article.

>TV loading is slow by nature :( Downside of approach is that you can't use TV and its methods to collect all children.

True

>OTOH an SQL cursor keeping all info with keys that tree would use is lightning fast to create (compared to loading). So even if a node's children are not populated yet still you could use cursor to collect all children, grandchildren, grandgrand...

Okay.