It displays a tree structure of requests nodes. 該編輯器顯示請求節點(diǎn)樹(shù)狀結構。
The count is then constructed into a binary tree using the Huffman algorithm to generate an optimized bit length coding. 然后,將該次數數字轉化成二進(jìn)制樹(shù)狀結構,再運用霍夫曼運算法則生成經(jīng)優(yōu)化的位長(cháng)編碼。