Binary search tree traversal for Arrick Robot virtual assembly training module

Nor Farhana Othman, Haslina Arshad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011
DOIs
Publication statusPublished - 2011
Event2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011 - Bandung
Duration: 17 Jul 201119 Jul 2011

Other

Other2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011
CityBandung
Period17/7/1119/7/11

Fingerprint

Robots
Binary trees
Students

Keywords

  • Arrick Robot
  • Binary Search Tree
  • Virtual Assemble
  • Virtual Reality

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Othman, N. F., & Arshad, H. (2011). Binary search tree traversal for Arrick Robot virtual assembly training module. In Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011 [6021772] https://doi.org/10.1109/ICEEI.2011.6021772

Binary search tree traversal for Arrick Robot virtual assembly training module. / Othman, Nor Farhana; Arshad, Haslina.

Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011. 2011. 6021772.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Othman, NF & Arshad, H 2011, Binary search tree traversal for Arrick Robot virtual assembly training module. in Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011., 6021772, 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011, Bandung, 17/7/11. https://doi.org/10.1109/ICEEI.2011.6021772
Othman NF, Arshad H. Binary search tree traversal for Arrick Robot virtual assembly training module. In Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011. 2011. 6021772 https://doi.org/10.1109/ICEEI.2011.6021772
Othman, Nor Farhana ; Arshad, Haslina. / Binary search tree traversal for Arrick Robot virtual assembly training module. Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011. 2011.
@inproceedings{a948af2c617642d4bc098c6b3c58d825,
title = "Binary search tree traversal for Arrick Robot virtual assembly training module",
abstract = "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.",
keywords = "Arrick Robot, Binary Search Tree, Virtual Assemble, Virtual Reality",
author = "Othman, {Nor Farhana} and Haslina Arshad",
year = "2011",
doi = "10.1109/ICEEI.2011.6021772",
language = "English",
isbn = "9781457707520",
booktitle = "Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011",

}

TY - GEN

T1 - Binary search tree traversal for Arrick Robot virtual assembly training module

AU - Othman, Nor Farhana

AU - Arshad, Haslina

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Arrick Robot

KW - Binary Search Tree

KW - Virtual Assemble

KW - Virtual Reality

UR - http://www.scopus.com/inward/record.url?scp=80054043764&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054043764&partnerID=8YFLogxK

U2 - 10.1109/ICEEI.2011.6021772

DO - 10.1109/ICEEI.2011.6021772

M3 - Conference contribution

SN - 9781457707520

BT - Proceedings of the 2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011

ER -