C A L LF O RP A P E R S
===
The 2008 International Conference on Frontiers
in Education: Computer Science and Computer Engineering
FECS'08
Date and Location: July 14-17, 2008, Las Vegas, U
What do you mean by best? Probably you mean optimal, which in this
case is linear complexity -- one such algorithm is the Knuth-Morris-
Pratt algorithm. The case insensitivity is very easy to get around,
just transform the input to lowercase for example, and use your
favourite string matching algo
Have you tried Google? This kinds of problems are usually given as
assignments, and there's plenty of information on the web. Here's one
for example:
http://www.cs.rpi.edu/academics/courses/fall00/ai/assignments/assign3heuristics.html
On Jan 9, 11:33 pm, monu <[EMAIL PROTECTED]> wrote:
> Hi guy
O(n) extra memory will suffice, and you already use O(n) memory to
store the tree, so I'm not sure what you mean by memory intensive.
It's certainly not the case that you will need a lot of additional
memory (otherwise, you could not store the tree in the first place).
An inorder traversal (which
