Introduction

Module 10:6: MeshTree

Author: YP

Learning Objectives

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

1. Explain the concept,basic advantages,concepts of Binary Tree and Binary Search Tree (BST).
2. Implement basic architectureoperations on BST: insert, search, delete.
3. Understand and perform various traversal methods: Inorder, Preorder, Postorder, and Level Order.
4. Recognize the use of IoTstd::map meshand networks.
std::set
5. Implementas implementations of a simplebalanced meshBST network(Red-Black using ESP32 with the painlessMesh library.Tree).
6. Build
a gateway (Root Node) to forward data from the mesh network to a server.