Huffman's algorithm is actually an "algorithm scheme", that is, a specification for an entire class of algorithms. Roughly speaking, Huffman's algorithm is any instantiation of the following scheme:
While there is more than one symbol, choose (in an unspecified way) two leaves of minimum total probability, and merge then (in an unspecified order).
Any particular instantiation will include a tie-breaking rule for choosing the two leaves, and will order them in some specific way.
In your case, there is only one choice for the two leaves, but there are several choices for the order (two at each of the three iterations of the algorithm). Hence your distribution supports 8 different "Huffman codes". It might be that the one you chose is not the canonical one which is produced by the specific implementation you were taught in class. The 8 Huffman codes for your distribution are:
A & 110 & 111 & 100 & 101 & 010 & 011 & 000 & 001 \\\hline
B & 10 & 10 & 11 & 11 & 00 & 00 & 01 & 01\\\hline
C & 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 \\\hline
D & 111 & 110 & 101 & 100 & 011 & 010 & 001 & 000\\
An important fact to be aware of is that not while Huffman's algorithm is guaranteed to produce a minimum redundancy code, not all minimum redundancy codes can be produced by Huffman's algorithm. See Gallager's classic paper Variations on a Theme by Huffman.