SIMULATION OF BINARY TREE USING (POST-ODER IN-ODER AND PRE-ODER)
Abstract
This project explores the simulation of binary tree traversal using pre-order, in-order, and post-order algorithms. Binary trees are pivotal in organizing data for efficient processing and retrieval, especially in areas such as database indexing, compiler construction, and artificial intelligence. The implementation simulates traversal operations to visualize node visitation order, enhancing user understanding of tree structures. The system was developed using an object-oriented approach and supports dynamic interaction with tree nodes. Through comprehensive analysis and structured design, the simulation ensures accuracy, responsiveness, and user-friendliness. This work not only demonstrates the practicality of classical data structures in modern computational environments but also provides a robust learning platform for computer science education.
Full-Text Access Notice
In accordance with the NERD Policy on promoting peer-reviewed publication, public access to the full text of a project, thesis or dissertation is restricted for three years, allowing the author and supervisors sufficient time to pursue peer-reviewed publication.
During this period, researchers with legitimate academic or research purposes may request authorisation directly from the author to enable NERD to release the indexed full texts of the work using the form below.