function smaller(tree, n, m, depth) {
	  var _n2 = n*2;
	  var _m2 = m*2;
	  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
	         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
	}
/* ===========================================================================
	 * Compares to subtrees, using the tree depth as tie breaker when
	 * the subtrees have equal frequency. This minimizes the worst case length.
	 */
Compares to subtrees, using the tree depth as tie breaker when
the subtrees have equal frequency. This minimizes the worst case length.
Compares to subtrees using the tree depth as tie breaker when the subtrees have equal frequency . This minimizes the worst case length .
function smaller(tree, n, m, depth) {
	  var _n2 = n*2;
	  var _m2 = m*2;
	  return (tree[_n2] < tree[_m2] ||
	         (tree[_n2] === tree[_m2] && depth[n] <= depth[m]));
	}
function smaller ( tree , n , m , depth ) { var _n2 = n * 2 ; var _m2 = m * 2 ; return ( tree [ _n2 ] < tree [ _m2 ] || ( tree [ _n2 ] === tree [ _m2 ] && depth [ n ] <= depth [ m ] ) ) ; }
Compares to subtrees, using the tree depth as tie breaker when
 the subtrees have equal frequency.
Compares to subtrees using the tree depth as tie breaker when the subtrees have equal frequency .
/*.Freq*/ /*.Freq*/ /*.Freq*/ /*.Freq*/