tree.m

) Compression using huffman code -with a number of bits k per code word -provide huffma

function y = tree(x)
k=length(x);
j=sort(x);
l=fliplr(j);
y(1,:)=l;
index=k;
for i=2:k
      l(index-1)=l(index)+l(index-1);
      l(index)=0;
      j=sort(l);
      y(i,:)=fliplr(j);
      index=index-1;
end