On Count-problems of Binary Tree
Hai Hu · Journal of Huaihai Institute of Technology · 2002
The common solution to the count problems of binary tree, the problems in stack permutations and the multiplication of matrixes is demonstrated with detailed explanations made to the certainty of the solution. The major methods of number combination theory are employed to take out its concrete characteristics and generalize its expression. Besides, formalizing demons trations are provided for the common solution according to mathematics and a concise algorithm is given for the realization of C code