0001 using HuffTree = BinTree<HuffChar>; //Huffman（子）树：由BinTree派生，节点都是HuffChar
0002 auto Weight = [](auto T) { return T.root()->data.weight; }; //根节点的频数，即子树的权重