Doubt in Huffman algorithm

Is it necessary to have a binary Huffman tree such that the left child of the node has to have a lower frequency of occurrence compared to its right child?
Basically I am trying to encode the symbols and present them in binary tree notation based on its frequency of occurrence.