The Algorithms and Data Structures Series: Trees 101

Trees are one of the most important data structures in computer science, forming the foundation for databases, file systems, and search algorithms. In this 90-minute class, we’ll explore the basics of tree data structures, how they’re organized, and why they’re so powerful for managing hierarchical data.

We’ll cover key concepts like nodes, edges, root, leaves, and depth, then move into practical examples in Python. You’ll learn how to build a tree, traverse it using common algorithms like depth-first search (DFS) and breadth-first search (BFS), and see how trees are used in real-world systems, from folder structures to decision-making processes.

Perfect for beginners who know some basic Python, this class will give you the tools to understand and implement trees in algorithms and data structures. By the end, you’ll not only know how trees work but also why they’re essential to solving complex computing problems efficiently.

The class will take place here - https://www.passion-class.com/en/join-sample-passionclass

If you want to join the full class, you can do so here: https://www.passion-class.com/en/classes/Thinking-and-Change/Programming