Huffman AlgoMurkyPig·FollowPublished in翛然野叟·1 min read·Feb 18, 2019--ListenSharegreedy有一message → BCCABBDDAECCBBAEDDCC建個表紀錄再透過表畫出,WEPL TREEpseudo code時間複雜度:O(nlogn)建立Queue: O(n)Priority Queue 均為 O(log n) for (n-1) 次則 O(NlogN)