Introduction

In this lesson, we’ll understand the structure and purpose behind the playground lessons, where you’ll implement the algorithms described in the first pseudocode lesson.

Here’s what we mean by playground lesson:

You have complete control of how you design the data structure and how you implement the functions.
- You decide which arguments the functions will accept.
- You decide the return values.
- You can even change the name of the functions if you prefer.
- You choose which strategy to use to implement the functions. You can use reference pointers, the return strategy, or something completely different.
- The only restriction is that your implementation must be generic. The BST implementation must work out of the box for any data type, be it an already existing data type (int, float, char*) or a user-defined data type (struct).
We don’t check the playground lessons automatically.
- It is your responsibility to test your implementation on various data types, find potential bugs or issues, and fix them. In the real world, no one will provide you with test cases.
- You’ll get in the habit of considering all these edge cases

...

Introduction

Stack and Local Memory

Passing Arguments to Functions

Pointer Arithmetic Basics

Pointers and Arrays

Pointers and Strings

Pointers and Functions

Write a Shell in C

Complex Pointer Declarations

Assessment 1

Heap and Dynamic Memory

Structures

Practicing Everything with Linked Lists

Assessment 2

Genericity Using Void Pointers

Advanced Memory Manipulation

Project Prep: Binary Search Trees

Efficiently Processing Temperature Samples

Efficient Dictionary

Efficiently Processing Employee Records

Conclusion

Pseudocode Lessons

Introduction