0023算法筆記——【貪心算法】哈夫曼編碼問題-文庫(kù)吧資料
2024-11-17 22:28本頁(yè)面
【正文】 44. PostOrder(rlChild)。142. {141. if(r!=NULL)140. 139. {*r)138. voidTInOrder(rrChild)。133. InOrder(rlChild)。131. {130. if(r!=NULL)129. 128. {*r)127. voidTPreOrder(rrChild)。122. 39。coutrdata39。120. {119. if(r!=NULL)118. 117. {*r)116. voidTDestroy(root)。112. 111. {BinaryTreeT::DestroyTree()109. templateclass108. 107. }return106. 105. {BinaryTreeT::TreeNodeCount()const103. templateclass102. 101. }return100. 99. {BinaryTreeT::TreeHeight()const97. templateclass96. 95. }92. voidTInOrder(root)。88. 87. {BinaryTreeT::In_Order()85. templateclass84. 83. }80. voidT73. templateclass72. 71. }67. templateclass66. *r)const。NodeCount(const*r)const。Height(const*r)。void61. InOrder(BTNodeT*r)。void59. *amp。void58. private:57. 56. Change(BTNodeTrightTree)。pData,BinaryTreeTvoid54. void53. 52. int51. int50. 49. void48. void47. void46. 45. BinaryTree()。43. BTNodeT42. public:41. 40. {BinaryTree38. templateclass37. 36. nn。BTNodeT(data,nl,nr)。nr=rChildCopyTree()。30. NULL。if(amp。26. 25. BTNodeT24. {23. CopyTree()rChild=Childr。19. data=val。17. {16. *Childr=NULL)val,BTNodeTTlChild=rChild=NULL。12. {11. BTNode()10. 9. BTNodeT8. T7. 6. {BTNode4. templateclass3. namespaceview plain 89. }w。()。x84. 83. }82. z。80. 79. ()。y77. =for(int74. HuffmanType73. //反復(fù)合并最小頻率樹72. 71. i++)i=n。i=1。Q(n)。z。w[i].tree65. =(i,zero,zero)。63. {62. i++)i=n。i=1。z,zero。HuffmanType[n+1]。=HuffmanType58. //生成單節(jié)點(diǎn)樹57. 56. {n)HuffmanTree(Type54. templateclass53. 52. }return51. coutendl。48. cout生成二叉樹的中序遍歷結(jié)果為：endl。46. 45. ()。43. coutendl。40. }39. for(int36. HuffmanTree(f,N)。t{0,45,13,12,16,9,5}。f[]}。,39。,39。,39。,39。,39。,39。{39。c[]29. int28. weight。tree。weight。constoperator20. publ
合同協(xié)議相關(guān)推薦
鄂ICP備17016276號(hào)-1