Sun Yong
Abstract
The paper describes the nature of traversal in binary tree,and integrates preorder traversal,inorder traversal,postorder traversal of a binary tree in one standard algorithm,which solves the problem of spatial complexity of binary tree traversal,making it more practical in application.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The paper describes the nature of traversal in binary tree,and integrates preorder traversal,inorder traversal,postorder traversal of a binary tree in one standard algorithm,which solves the problem of spatial complexity of binary tree traversal,making it more practical in application.
Key concepts: Tree traversal, Binary tree, Preorder, Graph traversal, Computer science, Tree (set theory), Binary number, Binary expression tree