Before we begin

Make sure to copy the previously implemented functions (getMin, getMax, getSize, and getHeight) from the previous playground. The goal is to build a complete implementation across the playground lessons. Having all the functions together will also help you test them together and find any potential wrong interactions.

Implementing the operations

You’ll implement the pseudocode from the previous lesson in this playground lesson.

We’ll first briefly go over the functions that you need to implement. Then, you can start implementing them in the code widget below.

The `getSuccessor` and `getPredecessor`

...

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

BST Operations: Playground (Part 3)

Before we begin

Implementing the operations

The `getSuccessor` and `getPredecessor`

Write a Shell in C

Assessment 1

Assessment 2

Efficiently Processing Temperature Samples

Efficient Dictionary

Efficiently Processing Employee Records

BST Operations: Playground (Part 3)

Before we begin

Implementing the operations

The getSuccessor and getPredecessor

The `getSuccessor` and `getPredecessor`