Which object search strategy is better?
Which is better - Depth-first or Breadth-first?
I already scanned through the documentation (link below) and already compared both by running a simple script, but I don't see much time difference.
Any thoughts on which would be better on certain occasions?
Solved! Go to Solution.
Best to leave it as default.
If you were to use the Find method; starting from the top most node and searching for a node at the bottom (height tree is 40), that's when you'll see differences. See Binary search tree