In Huffman coding, data in a tree always occur?
(a) roots
(b) leaves
(c) left sub trees
(d) right sub trees
This question was posed to me in semester exam.
The origin of the question is Greedy Algorithms in chapter Greedy Algorithms of Data Structures & Algorithms II