DataStructures-And-Algorithms

1. Huffman Coding : Using Priority Heap and Tree
2. Fibonnaci Number: get nth number in fibonnaci series in run time O(log n)
3. Trie DataStructure Implementation (In BasicDataStrucres) : put, remove, get word in trie are implemented.