the decoding of Huffman codes is shown. For the decoding the coding tree has to be constructed using the information which has to be transmitted as well.

Following that the input is read bitwise and for each 0 a left turn is taken and for each one a right turn until a leave is reached. In this case the value of the leave (usually a character) is output, continuing after that at the root.