binary tree traversal is defined as a process of visiting each node n a speecifed order. there are consist of two ways to visit a tree which are recursively and non-recursively. our literature survey showed that most of te references only focus on how to implement the fastest and simplest recursive algorithms for inorder,preorder and postorder traversals to get the most accurate assembly sequence. arrick robot willbe used as the model for this research. to assemble a robot,sequence of the parts aseembled must be right. the recursive postorder travelsal algorithm applied for the virtual robot assembly was found to be more suitable than inorder and preorder traversal. to get a faster insertion and delection,the assembly sequence have to be in correct order. during assembly, the parts assembly can be visualized and animated for students to practice and master the real arrick robot. errors will be prompted when the robot is not assembled correctly.