Computer Science · 12th Grade

Active learning ideas

Implementing Linked Lists (Singly and Doubly)

Active learning works well for linked lists because students often struggle with abstract pointer concepts. Hands-on activities transform abstract nodes and references into physical experiences, making dynamic memory allocation concrete. Simulations and collaborative labs let students feel the flow of traversal and insertion before wrestling with syntax.

• Common Core State Standards
• CSTA: 3B-AP-12
• CSTA: 3B-AP-14

• 25–60 min
• Pairs → Whole Class
• 4 activities

Activity 01

• Simulation Game
• 30 min · Whole Class

Simulation Game: Human Linked List

Each student is a 'node' holding a card with a value and pointing to the next student in line. The teacher calls operations: insert after node 3, delete node 5, traverse and print all values. Students must physically rearrange and update their pointer cards. Edge cases like deleting the head or tail node become immediately visible, making the required pointer updates concrete.

Why would a developer choose a linked list over a standard array for data storage?

Facilitation Tip

During the Human Linked List, stand at the back and watch where students place their hands to spot confusion between next and prev pointers immediately.

What to look for

Present students with a small, partially implemented linked list code snippet. Ask them to identify the missing lines of code required to insert a new node at the beginning of a singly linked list and explain their reasoning.

• Apply
• Analyze
• Evaluate
• Create
• Social Awareness
• Decision-Making

Activity 02

• Peer Teaching
• 60 min · Pairs

Collaborative Lab: Build It From Scratch

Pairs implement a singly linked list with insert, delete, and display methods, then extend it to a doubly linked list by adding a prev pointer and an insertBefore method. After completing both, partners write a 5-sentence comparison focusing on what code changed and which operations become easier or harder with bidirectional links.

Compare the advantages and disadvantages of singly versus doubly linked lists.

Facilitation Tip

In Build It From Scratch, circulate and ask each pair to explain how their insert method updates exactly two references, not just the code.

What to look for

Pose the question: 'Imagine you are building a music player playlist. Would a singly or doubly linked list be a better choice, and why? Consider features like playing the next song, playing the previous song, and adding a song to the end.' Facilitate a class discussion comparing student choices.

• Understand
• Apply
• Analyze
• Create
• Self-Management
• Relationship Skills

Activity 03

• Think-Pair-Share
• 25 min · Pairs

Think-Pair-Share: Linked List vs. Array

Present 5 scenarios: storing a leaderboard, implementing undo history, managing a shopping cart, indexing a database, streaming media chunks. Students individually choose the better data structure for each and justify their choice in writing. Pairs compare and discuss disagreements, then the class builds a shared decision framework on the board.

Construct a linked list implementation that handles edge cases like empty lists or single-node lists.

Facilitation Tip

During the Gallery Walk, provide sticky notes so observers can leave targeted questions for debuggers to answer aloud.

What to look for

On an index card, have students write down one advantage of using a linked list over an array for a specific task (e.g., inserting into the middle) and one disadvantage of a doubly linked list compared to a singly linked list.

• Understand
• Apply
• Analyze
• Self-Awareness
• Relationship Skills

Activity 04

• Gallery Walk
• 35 min · Pairs

Gallery Walk: Edge Case Debugging

Post 6 stations showing buggy linked list code, each with a different edge case failure: null pointer on empty list, losing the head reference during deletion, infinite loop on a faulty traversal, and others. Student pairs identify the bug, trace the pointer error, and write a 2-line fix. During debrief, pairs share which bug was hardest to spot and why.

Why would a developer choose a linked list over a standard array for data storage?

Facilitation Tip

In Think-Pair-Share, deliberately assign one student to defend arrays and another to defend linked lists to push opposing views.

What to look for

Present students with a small, partially implemented linked list code snippet. Ask them to identify the missing lines of code required to insert a new node at the beginning of a singly linked list and explain their reasoning.

• Understand
• Apply
• Analyze
• Create
• Relationship Skills
• Social Awareness

A few notes on teaching this unit

Teachers should anchor every abstract idea to physical or visual models before code appears. Start with the Human Linked List so students embody the node relationships. Then move quickly to Build It From Scratch, where they confront pointer errors in real time. Avoid long lectures on memory addresses; instead, use live demos to show how deletion affects references and garbage collection. Research shows that students grasp pointer shifts faster when they debug live outputs than when they read static diagrams.

By the end, students will confidently write Node classes, traverse lists, and implement insertion and deletion without confusion about pointers. They will compare singly and doubly linked lists, justify structure choices with real scenarios, and debug edge cases. Success means clear code, correct outputs, and articulate explanations of memory behavior.

---

Watch Out for These Misconceptions

• During the Human Linked List activity, watch for students who treat the list as a circular chain when they should be forming a straight line from head to tail.

  After the Human Linked List, gather students and ask two volunteers to model insertion at the head and tail. Point out that only one reference changes in each case, reinforcing the linear structure before moving to code.

• During Build It From Scratch, watch for students who assume deleting a node automatically frees memory in all languages.

  In the lab, have students run identical deletion code in Python and C++. Observe the interpreter’s immediate garbage collection versus the C program’s lingering memory, then discuss explicit free() calls in C.

• During the Think-Pair-Share on singly vs doubly lists, watch for students who claim a doubly linked list is just two traversals of a singly linked list.

  Prompt pairs to trace an insertBefore operation on both structures. When they see the singly list must restart from head, contrast it with the doubly list’s direct prev pointer. Use the moment to label the structural difference clearly.

---

Methods used in this brief

• Simulation Game
• Peer Teaching
• Think-Pair-Share
• Gallery Walk