Interesting.<p>The first 4 results on the standard SERP for "trie" are Wikipedia, a pretty decent BU article on Tries with Sedgewick-style source code, an intro-to-tries article, and an article about using Tries for spellchecking.<p>The first 4 results on the CS SERP are a Princeton CS PPT on tries, Java source code for a trie, a paper on inductive logic programming using tries, and a tech report on "Nye's Trie" which looks like an interesting distributed systems solution modeled on tries.<p>The results for the two searches for "red-black tree" are approximately the same; all tutorial material.<p>The results for "bloom filter" are like those for "trie": the standard SERP is all tutorial material, and the CS SERP is mostly research.<p>CS search looks like an interesting middle ground between Scholar (which I use all the time) and standard Google. Thanks!