A Unified Strategy for Formal Derivation and Proof of Binary Tree Nonrecursive Algorithms

In the formal derivation and proof of binary tree algorithms, Dijkstra's weakest predicate method is commonly used. However, has some drawbacks, including a time-consuming process, complicated loop invariants, inability to generate executable programs from specification. This paper proposes unified strategy for non-recursive algorithms address these issues. First, problem solving sequences are decomposed into two types recursive relations based on queue stack, corresponding invariant templates constructed. Second, high-reliability Apla (abstract programming language) derived using invariants. Finally, converted automatically C++ programs. Two problems with stack used as examples, their performed validate proposed strategy's effectiveness. improves efficiency correctness algorithm derivation.