I have a new assignment about Huffman encoding, there is part of the assignment that is not clear to me, I searched the web, but could not find an answer, I need some help to understand this part. it is as follows:
The standard algorithm states that you should use a priority queue(aka heap) to store the trees. Use a heap of tree pointers instead, it makes combining the trees much easier and more efficient, and since they are pointers you don't have to copy any tree data. this technique is called indirect storage and is used on large and/or complex data type.
What is an indirect storage, and how can I use a heap of tree pointers.. Is there any link that explain indirect storage in details.
I highly appreciate your help, thanks