# Cambridge International A Level Computer Science (9618): Section 19: Computational Thinking

> Binary search algorithms, Binary Search Trees (BST), recursion vs iteration, call stacks, and dynamic data structures (hash tables, collision resolution).

- **Track:** [Cambridge International A Level Computer Science (9618)](https://csmasters.dev/tracks/a-level-9618.md) (CAMBRIDGE A LEVEL 9618)
- **Module:** Section 19: Computational Thinking
- **Total Lessons:** 4
- **URL:** https://csmasters.dev/tracks/a-level-9618/course_modules/19-computational-thinking-and-problem-solving

---

## Module Lessons

### Lesson 1: [19.1 Binary Search Algorithm in Cambridge Pseudocode](https://csmasters.dev/learn/a-level-9618/binary-search-algorithm.md)
- **Estimated Duration:** 25 mins
- **XP Reward:** 60 XP
- **Access Level:** Open Theory (All-Access Practice)
- **HTML Link:** https://csmasters.dev/learn/a-level-9618/binary-search-algorithm

### Lesson 2: [19.2 Binary Search Trees (BST): Insertion & Traversals](https://csmasters.dev/learn/a-level-9618/binary-search-trees.md)
- **Estimated Duration:** 15 mins
- **XP Reward:** 30 XP
- **Access Level:** Open Theory (All-Access Practice)
- **HTML Link:** https://csmasters.dev/learn/a-level-9618/binary-search-trees

### Lesson 3: [19.3 Recursion vs Iteration & The Call Stack](https://csmasters.dev/learn/a-level-9618/recursion-vs-iteration.md)
- **Estimated Duration:** 15 mins
- **XP Reward:** 30 XP
- **Access Level:** Open Theory (All-Access Practice)
- **HTML Link:** https://csmasters.dev/learn/a-level-9618/recursion-vs-iteration

### Lesson 4: [19.4 Dynamic Data Structures: Hash Tables & Collision Resolution](https://csmasters.dev/learn/a-level-9618/hash-tables-and-dictionaries.md)
- **Estimated Duration:** 15 mins
- **XP Reward:** 30 XP
- **Access Level:** Open Theory (All-Access Practice)
- **HTML Link:** https://csmasters.dev/learn/a-level-9618/hash-tables-and-dictionaries