Implementation of a string trie

[clintp]

I've seen a few people asking for this elsewhere, so here's a basic
implementation of a string trie in C#. I'm using this to load and
search a dictionary of about two hundred thousand words. It's fairly
quick (a couple of seconds for the full load). It's a bit of a memory
hog -- about 50MB resident, once the file is loaded -- but most of my
C#/.NET programs are.

Example usage:

StringTrie st = new StringTrie();
st.LoadFromFile ("wordlist.txt" );
st.Add("additio nalword");
st.Add("additio nalotherword");
if ( st.Search("mywo rd") == StringTrie.Foun d )
etc...
using System;
using System.IO;
using System.Collecti ons.Generic;
using System.Text;

namespace TrieLib
{
class StringTrie
{
private StringTrieBucke t bucket = new StringTrieBucke t(' ');

public enum SearchResults
{
NotFound,
Found,
FoundPartial
}

public StringTrie()
{
}

public void LoadFromFile(st ring pathname)
{
TextReader tr = File.OpenText(p athname);

string line;
while ( (line = tr.ReadLine() ) != "")
{
string[] sa = line.Split(' ');
foreach (string s in sa)
if (s.Length < 11)
Add(s);
}
tr.Close();
GC.Collect();
}

public void Add(string s)
{
Queue<charlette rs = new
Queue<char>(s.T oLower().ToChar Array());
AddToTrie(bucke t, letters);
}

public SearchResults Search(string s)
{
Queue<charlette rs = new
Queue<char>(s.T oLower().ToChar Array());
return SearchTrie(buck et, letters);
}

private SearchResults SearchTrie(Stri ngTrieBucket b,
Queue<charlette rs)
{
if (letters.Count == 0)
if (b.terminal)
return SearchResults.F ound;
else
return SearchResults.F oundPartial;

Char c = letters.Dequeue ();
StringTrieBucke t bucket = b;
foreach (StringTrieBuck et stb in b.kids)
if (stb.letter == c)
return SearchTrie(stb, letters);

return SearchResults.N otFound;
}

private void AddToTrie(Strin gTrieBucket b, Queue<char>
letters)
{
if (letters.Count == 0)
{
b.terminal = true;
return;
}
Char c = letters.Dequeue ();
StringTrieBucke t bucket = null;
bool found = false;
foreach (StringTrieBuck et stb in b.kids)
if (stb.letter == c)
{
bucket = stb;
found = true;
break;
}
if (! found)
{
bucket = new StringTrieBucke t(c);
b.kids.Add(buck et);
}
AddToTrie(bucke t, letters);
}
}

class StringTrieBucke t
{
internal char letter;
internal List<StringTrie Bucketkids;
internal bool terminal;

internal StringTrieBucke t(char c)
{
this.letter = c;
kids = new List<StringTrie Bucket>();
terminal = false;
}
}
}