We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
In huffman code, the most frequent ones will be nearer to root than all other leaves.So, we will have to make only small number of large iterations.
Hope that clears your doubt !
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Huffman Decoding
You are viewing a single comment's thread. Return to all comments →
In huffman code, the most frequent ones will be nearer to root than all other leaves.So, we will have to make only small number of large iterations. Hope that clears your doubt !