Introduction

Module 6: Tree

Author: YP

Learning Objectives

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

1. Explain the basic concepts of Binary Tree and Binary Search Tree (BST).
2. Implement basic operations on BST: insert, search, delete.
3. Understand and perform various traversal methods: Inorder, Preorder, Postorder, and Level Order.
4. Recognize the use of std::map and std::set as implementations of a balanced BST (Red-Black Tree).