List/tree/Stack - Algorithm

Question

Hey guys,

I need to do a project at the college, it needs to use list/tree/stack to perform any task. I was thinking on the Google's algorithm to recognize the phrase while the guy is typing.

Does anyone has this algorithm? Or any other better idea that use list/tree/stack?

Thanks

Answer 1

You can do almost anything with a list/tree/stack. I wouldn't try the phrase recognition one, though - that'd be a substantial amount of work. You could do something easy like a phone book / dictionary / etc.

Answer 2

Here you go: http://amjith.blogspot.com/2009/05/algorithm-for-incremental-string-search.html

Answer 3

Demonstrate Huffman coding.

Answer 4

Tree is the buzz-word here. Implement a tree where the nodes can have an arbitrary number of child nodes. There's list. Implement an algorithm that iterates every node in the tree without using recursion. There's stack.

Answer 5

I would suggest a suffix tree, just an improvisation of a tree

http://en.wikipedia.org/wiki/Suffix_tree