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