Binary search tree traversal for Arrick Robot virtual assembly training module

Binary tree traversal is defined as a process of visiting each node in a specified order. There are consist of two ways to visit a tree which are recursively and non-recursively. Our literature survey showed that most of the references only focus on how to implement the fastest and simplest recursive and non-recursive algorithms. We investigate recursive algorithms for inorder, preorder, and postorder traversals to get the most accurate assembly sequence. Arrick Robot will be used as the model for this research. To assemble a robot, sequence of the parts assembled must be right. The recursive postorder traversal algorithm applied for the virtual robot assembly was found to be more suitable than inorder and preorder traversal. To get a faster insertion and deletion, the assembly sequence have to be in correct order. During assembly, the parts assembled can be visualized and animated for students to practice and master the assembly process before they can actually assemble the real Arrick Robot. Errors will be prompted when the robot is not assembled correctly.