1. Firstly, the symbols are arranged in descending probability, and the Fibonacci coding tree is constructed recursively.

2. Secondly, put all symbols into a node and calculate the sum of their probabilities.

3. Finally, the code tree allocation process, in which the coded codewords are allocated to the code tree, and finally the code tree diagram of Feno coding is obtained.