BST Operations: Playground (Part 3)
Explore the implementation of essential Binary Search Tree operations in C, including getSuccessor, getPredecessor, rangeCount, and rangeSearch. This lesson guides you through coding these functions, handling dynamic memory, and testing across various data types to solidify your understanding of BST manipulations.
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.