public string Decode(BitArray bits)
{
breanch current = this.Root;
string decoded = "";
foreach (bool bit in bits)
{
if (bit)
{
if (current.Right != null)
{
current = current.Right;
}
}
else
{
if (current.Left != null)
{
current = current.Left;
}
}
if (IsLeaf(current))
{
decoded += current.Symbol;
current = this.Root;
}
}
return(decoded);
}
public void Build(string source)
{
for (int i = 0; i < source.Length; i++)
{
if (!Frequencies.ContainsKey(source[i]))
{
Frequencies.Add(source[i], 0);
}
Frequencies[source[i]]++;
}
foreach (KeyValuePair <char, int> symbol in Frequencies)
{
nodes.Add(new breanch()
{
Symbol = symbol.Key, Frequency = symbol.Value
});
}
while (nodes.Count > 1)
{
List <breanch> orderedNodes = nodes.OrderBy(node => node.Frequency).ToList <breanch>();
if (orderedNodes.Count >= 2)
{
// Take first two items
List <breanch> taken = orderedNodes.Take(2).ToList <breanch>();
// Create a parent node by combining the frequencies
breanch parent = new breanch()
{
Symbol = '*',
Frequency = taken[0].Frequency + taken[1].Frequency,
Left = taken[0],
Right = taken[1]
};
nodes.Remove(taken[0]);
nodes.Remove(taken[1]);
nodes.Add(parent);
}
this.Root = nodes.FirstOrDefault();
}
}
public bool IsLeaf(breanch node)
{
return(node.Left == null && node.Right == null);
}
