On Sat, Apr 17, 2010 at 1:05 AM, Per Vognsen <per.vogn...@gmail.com> wrote: > You can only do slow > linear-time lookups by traversing the tree's nodes exhaustively.
Correction: You do not have to do a linear search on the whole tree but only on the subset of the tree for which the comparator returns 0 with your queried value. That is the whole tree in the worst case and a significant fraction of the whole tree in many practical cases. Let's say the tree is constructed based on age and you're searching a university database for some specific person aged 18. The span of ages among university students is small, so a logarithmic search of the age-based tree probably only reduces the total search space by a fourth. Even with the help of the tree, you're still left to linear search n/4 elements. -Per -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
