huffman coding sequence

Question

In huffman  coding how to know whether we should designate left child as 0 and right as 1 or vice versa..??

Comments

By default we consider left as 0 if Not mentioned.

---

The answer will be 101.

                                                                        66

                                                                    /         \

                                                                27             39

                                                              /     \            /    \

                                                          12     15        19   20

                                                                 /      \     /    \

                                                              7         8  9       10

                                                                            /  \

                                                                         4      5

 step 1 : 4 + 5=9

step  2: 7 + 8=15

step 3: 9+10=19

step 4: 12 + 15=27

step 5: 19+20=39

step 6: 27+39=66

Note: At each step take minimum two elements from priority_queue(Or min_heap()) then add them and push again into the heap.continue:)

Answer 1

Binary code of m5 is 110

Comments

they have given 001..how would you know whether which way to put 0's and 1's...??? logically both are correct but still what is the default case

---

Default case is left child 0 and right child 1.

---

but u have taken the children towards left it should be on right...isn't it..?

---

In above tree , always we take two minimum and add them afterwards we take next no. If no. Is less then we make left child otherwise right child. .

I hope you will understand.