mmm. . .binary trees. . .
Published January 31st, 2006 in ITP, blog, p5, teaching_
Today in my Programming from A to Z course we’ll be going over how to program a simple concordance in Java storing words in a binary search tree. It may be hairy, but I hope it proves to be a useful means for improving the programming skills of ITP students. . . if any data structure / algorithm gurus wander by this site, please feel free to correct any mistakes i’ve made in this initial tutorial. . . being the severely flawed human being that i am, i’m sure they exist. .
Hi Daniel,
Since you’re searching on words, another great structure for you to look at is a trie. Much more efficient text-searching goodness.
was looking through dreamhost site of the month winners. thought i’d check yours out. thought i’d let you know i hate BSTs. (i’m in my third semester of java, the BST lab was last year and was particularly hairy.) that’s all.