Huffman Encoding

Question

Comments

@gabbar bro how u calculated miniumum and maximum no of comparision?

---

there is n1 and n2 characters total  n1+n2
worst case : n-1 comparison
Best case : n1 comparisons

 i.e. n1=5 and n2=9   worst case=5+9-1 Best case=5
Build Huffman Tree and each stage calculate comparisons.
THis way i have done ! not sure

---

i think the algorithm of OPTIMAL MERGE PATTERN will play some role here

Answer 1

construct huffman tree max number of comparisions nothing but max heights of the tree

min number of comparisions nothing but min height.(like no comparisions in a b-tree)

Comments

bro i think its 4-1=3

---

how is minimum number of comparisons equal to 2?