Parallel Algorithm Design for Binary Tree Traversing Sequence Based on Coding

Parallel algorithm for binary tree traversing sequence based on coding is proposed in the paper. The method is understood and mastered easily, which can simplify the traversing process, makes the process for educing binary tree traversing sequence becoming quickly and intuitive, fits to the demonstration of traversing process in classroom teaching, and can improve the computing efficiency and accuracy through avoiding complex description aroused by recursive calling directly from the definition. The algorithm embodies a deduction idea that is from abstract to concrete, from special to general. The traversing process of the parallel algorithm is described in detail and analyzed verified with an application instance.