给定一组权值(5,9,11,2,7,16),试设计相应的哈夫曼树,并求出该二叉树的带权路

for(int i = 0; i < 5; i++){
try {
if(i == 0){
continue;
}
if(i == 1){
throw new Exception();
}
if(i == 3){
break;
}
System.out.println("try..." + i);
} catch (Exception e) {
System.out.println("catch..." + i);
} finally {
System.out.println("finally..." + i);
}
}

图不知道怎么上传，计算得wpl=121