1. Introduction

Module 6: Tree

Author: YP 

Learning Objectives

After completing this module, students are expected to be able to:

1. Explain the basic conceptsconcept of a Binary Tree as a non-linear data structure.
2. Identify the differences between root, parent, child, leaf, and Binary Search Tree (BST)subtree.
3. Implement basic operations on BST: insert, search, delete.
4. Understand and perform various traversalTraversal methods: Inorder, Preorder, Postorder, and Level Order.
5. RecognizeUnderstand the userole of std::mapStack and std::setQueue asin implementationstraversal algorithms.
6. Apply the concept of aTrees balancedto BSTreal-world (Red-Blackcases Tree)in daily life.