Objects, algorithms and data structures

See the next step.
Then explain why.

Create a character, follow a function call and trace a traversal. These activities connect the Python code with the data it changes.

Optional practice. Exams are based on lecture notes. This first collection covers selected examples, not every topic.

09

Stacks, queues and brackets

Insert the same items into a stack and a queue. Predict which item leaves next. Then use a stack to check matching brackets.

Lecture 9 · Longer version · Slides 25 through 43 and 49 through 56

10

Linked list operations

Insert and remove nodes. Follow the changed references and test what happens when the list becomes empty.

Lecture 10 · Longer version · Slides 13 through 23

11

Tree traversal

Follow the lecture DFS and BFS visit orders on the same binary tree. Try inorder and postorder as optional comparisons. This tree has no search ordering rule.

Lecture 11 · Slides 14 through 19

Still to come

More examples, one topic at a time

Future activities can cover operation counts, binary search, recursive sums, circular queues and doubly linked lists. Middle node, reversal, cycle detection and sorting can form separate extensions.

Recorded videos are not available yet. The interactive activities let you control the pace yourself.