Description Submission 1 Special Testcase: [[]] Submission 2 Maintaining an increasing list of the first elements, no improvement but only space cost added. Submission 3 […]
Tree: Huffman Decoding
Description Submission If ‘0’, go left, if ‘1’, go right. If it is a leaf node, get the charater. Background Knowledge Huffman Coding Priority Queue […]