# 1. Introduction

# Module 6: Tree

#### <span style="color:yellow;">**Author:** YP </span>

## **Learning Objectives**

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