Create leaf nodes (B) for each character with their frequency. Build a priority queue (C) (min-heap) based on frequency. Combine lowest frequency nodes (D) repeatedly to form new internal nodes. Repeat until root formed (A) — the final remaining node is the root of the Huffman tree. Hence, the correct order is B → C → D → A.