ED: Data Structures with Python at the University of Caldas

Documentation Index

Fetch the complete documentation index at: https://mintlify.com/tutosrive/ed/llms.txt

Use this file to discover all available pages before exploring further.

​

What the Course Covers

• Recursion — Both stack-based (LIFO) and tail (FIFO) recursive strategies, explored through binary search, factorial calculation, Fibonacci sequences, and list summation.
• Binary Search Trees (BSTs) — Construction, traversal, search, and node removal in BSTs, with exercises reinforcing tree theory through implementation.
• Graphs — Representation, traversal, and analysis of graph structures, examined through teacher-led explanations and practical coding sessions.

​

Repository Structure

ed/
├── src/
│   ├── HOMEWORKS/
│   │   └── BTS/
│   │       └── BTS_search_and_remove.ipynb
│   ├── explanations/
│   │   └── teacher/
│   │       └── colab/
│   │           ├── BST_Jue_Vie.ipynb
│   │           ├── Graph.ipynb
│   │           └── Graph_Mar_Jue.ipynb
│   └── workshops/
│       └── colab/
│           └── workshop_1_ED.ipynb
└── README.md

• src/workshops/colab/ — Hands-on workshop notebooks completed by students during class.
• src/explanations/teacher/colab/ — Instructor-authored notebooks walking through BSTs and Graphs concept by concept.
• src/HOMEWORKS/BTS/ — Graded homework notebooks covering tree search and node removal.

​

Explore the Topics