Who has a faster tree query in MS SQL?

Question

SQL

Actually, I came up with my own method of bypassing a tree and picking leaves :)
I would like to understand how fast it is.
Bicycle type:
- link table 34 488 lines
So.
bypassing and displaying the entire "piccha" tree (with unlimited depth ... well, large enough to consider it unlimited :D) was in my database - 4 sec.
result:
for 100 k. lines and a depth (without roots) of 15 branches to a leaf.
what are your results?
maybe it's slower than a turtle? :D

Answer 1

Write an algorithm or a script - then there will be a subject of discussion. In the meantime, this is just a measure of merit. Moreover, the processing time is not the only characteristic of the algorithm. There are still requested resources (percentage, memory).

Answer 2

reading data for forming a tree and expanding the full structure 2 requests:
1
2
3 well, this is how it looks: