To obtain Huffman coding we use data structure called min heap. At the initial phase all the nodes has to be present in heap(satisfying min-heap property).
If there are n elements in tree then space complexity will be O(n) which is extra space required.