Abstract: This paper deals with all the threads of the binary tree succeeding in postorder traversing. It proves the principle of the structure, describes the process of realization, and gives the principal methods of calculating the succedent binary tree with all the threads. Finally, it proves that all the threads have an advantage over part threads.