public void CollectWords(Trie node, string prefix, ref List<string> words)
{
if (!node.nodeChars.Any())
{
words.Add(prefix);
return;
}
var sb = new StringBuilder(prefix);
foreach (var v in node.nodeChars)
{
CollectWords(v.Value, prefix + v.Key, ref words);
}
}
static void Main(string[] args)
{
//FIFO
Queue queue = new Queue();
Console.WriteLine(queue.IsEmpty());
queue.Add(1);
queue.Add(3);
queue.Print();
Console.WriteLine(queue.Peek());
queue.Add(5);
queue.Add(2);
queue.Print();
queue.Remove();
queue.Print();
//LIFO
Stack stack = new Stack();
Console.WriteLine(stack.IsEmpty());
stack.Push(1);
stack.Push(3);
stack.Print();
Console.WriteLine(stack.Peek());
stack.Push(5);
stack.Push(2);
stack.Print();
stack.Pop();
stack.Print();
Console.ReadKey();
LinkedList linkedList = new LinkedList(1);
linkedList.PrindList();
linkedList.Delete();
linkedList.Append(2);
linkedList.PrindList();
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete();
linkedList.PrindList();
linkedList.Clear();
linkedList.PrindList();
linkedList.Append(2);
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete(4);
linkedList.PrindList();
linkedList.Clear();
linkedList.PrindList();
linkedList.Append(2);
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete(2);
linkedList.PrindList();
linkedList.Clear();
linkedList.PrindList();
linkedList.Append(2);
linkedList.Append(4);
linkedList.Append(10);
linkedList.PrindList();
linkedList.Delete(10);
linkedList.PrindList();
Console.ReadKey();
Console.WriteLine("Hello World!");
HeapMin heapMin = new HeapMin();
heapMin.printArray = true;
heapMin.Add(3);
heapMin.Add(4);
heapMin.Add(8);
heapMin.Add(1);
heapMin.Add(7);
heapMin.Add(2);
heapMin.Add(5);
int min = heapMin.Peek();
Console.WriteLine(min); // should == 1
heapMin.Pool();
heapMin.Pool();
heapMin.Pool();
min = heapMin.Peek();
Console.WriteLine(min); // should == 4
//Console.ReadKey();
//BSTree bSTree = new BSTree(10);
//bSTree.Insert(15);
//bSTree.Insert(5);
//bSTree.PrintInOrder();
//bSTree.Insert(8);
//bSTree.PrintInOrder();
//Console.WriteLine(bSTree.Contains(8));
//Console.WriteLine(bSTree.Contains(18));
//Console.ReadKey();
string[] keys = { "the", "a", "there", "answer",
"any", "by", "bye", "their" };
string[] output = { "Not present in trie", "Present in trie" };
Trie trie = new Trie();
// Construct trie
for (int i = 0; i < keys.Length; i++)
{
trie.Insert(keys[i]);
}
// Search for different keys
if (trie.Contains("the") == true)
{
Console.WriteLine("the --- " + output[1]);
}
else
{
Console.WriteLine("the --- " + output[0]);
}
if (trie.Contains("these") == true)
{
Console.WriteLine("these --- " + output[1]);
}
else
{
Console.WriteLine("these --- " + output[0]);
}
if (trie.Contains("their") == true)
{
Console.WriteLine("their --- " + output[1]);
}
else
{
Console.WriteLine("their --- " + output[0]);
}
if (trie.Contains("thaw") == true)
{
Console.WriteLine("thaw --- " + output[1]);
}
else
{
Console.WriteLine("thaw --- " + output[0]);
}
if (trie.Contains("thei") == true)
{
Console.WriteLine("thei --- " + output[1]);
}
else
{
Console.WriteLine("thei --- " + output[0]);
}
if (trie.Contains("thei", true) == true)
{
Console.WriteLine("thei (full word search) --- " + output[1]);
}
else
{
Console.WriteLine("thei (full word search) --- " + output[0]);
}
Console.ReadKey();
}
public TriePrefixEnumerator(Trie trie)
{
this.trie = trie;
parents.Push(new PrefixNode(string.Empty, trie.Root, 0));
}
public Trie Include(char c)
{
if (nodeChars.ContainsKey(c))
{
return nodeChars[c];
}
var child = new Trie();
nodeChars.Add(c, child);
return child;
}
public void SetUp()
{
trie = new Trie();
}
public void SetUp()
{
trie = new Trie();
}