Introduction

The course’s goal is to learn how to write pointer-intensive code. Therefore, after understanding binary search trees at a conceptual level, you’ll have to implement the functions in C using pointers and memory allocations. After that, inside the project, you’ll use the newly implemented structure to solve some common real-life problems.

The lessons in this chapter will be in pairs:

A pseudocode lesson where we understand the ideas behind the algorithms for binary search trees.
A playground lesson where you will implement the algorithms in C. Make sure to understand the logic behind the algorithms. Otherwise, it will be hard to implement them in C.

The purpose of this lesson is to give some tips and tricks for implementing the functions in C using pointers. Binary search ...

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

Implementation Tips and Tricks

Introduction