1. Introduction

Module 6: Tree 
 Author: YP 
 Learning Objectives 
 After completing this module, students are expected to be able to: 
 
 Explain the basic concept of a Tree as a non-linear data structure. 
 Identify the differences between root, parent, child, leaf, and subtree . 
 Implement Traversal methods: Inorder, Preorder, Postorder, and Level Order. 
 Understand the role of Stack and Queue in traversal algorithms. 
 Apply the concept of Trees to real-world cases in daily life .