第五章 树3.ppt

for (i = 0; in-1; i++) { hp.RemoveMin(first); hp.RemoveMin(second); mergeTree(fist, second, perant); Hp.insert(parent); root = parent; } }; template class T, class E void HuffmanTreeT, E :: mergeTree (HuffmanNodeT, E bt1, HuffmanNodeT, E bt2 HuffmanNodeT, E *parent) { parent = new E; parent-leftChild = bt1; parent-rightChild = bt2; parent-data.key = bt1.root-data.key + bt2.root-data.key; bt1.root-parent = bt2.root-parent = parent; }; 15 8 5 7 3 初始时将n个叶结点组织成最小堆； 执