Breadcrumbs? Path Trail? Whatever you may call it it’s a pretty common navigational technique but there are plenty of ways to implement such a navigation tool. Normally when i see posts about JavaScript, i dont take the time to read it, let alone review the code. However; this hit me as somehow i saw one side of the tree having branches that can be followed to it’s root trunk. Well, breadcrumbs tends to follow that same idea. From what i read here, traversing the tree and learning left and right.. well, we ignore one side and get the other. Sounds like a better method than what im doing currently fro breadcrumbs. So now… i am thinking about a new challenge… how to efficiently do the same task in PHP.

I could be way off base, but this way of thinking may very apply to breadcrumbs navigation. Please correct me if im wrong.

In the case of JavaScript, putting the data into an array and using sort() on the array would (presumably) be faster than making any custom-rolled sorting algorithm.

Also there’s the issue of performance because of depth. The bigger the tree gets, the more depth it has, and so you end up with nodes that are way down the tree, like rootNode.left.left.left.left.left.left. Each layer of depth has a performance hit unfortunately.

Hope this helps,
-David

Forgive my ignorance, but why would you never want to use a binary search tree in javascript in practice?

Thanks!