Search⌘ K
Home
Courses
An In-Depth Understanding of Memory and Pointers in C

BST Operations: Pseudocode (Part 2)

Explore how to determine the minimum, maximum, size, and height of binary search trees using recursive pseudocode. Understand the traversal needed to find nodes and compute these properties, helping you implement efficient BST operations in C.

We'll cover the following...

The getMin and getMax functions

Another property of a binary search tree is that we can find the minimum and maximum elements without sorting the data.

Look again at our binary search tree. If we look at the nodes, we see that:

  • 1 is the minimum value and the leftmost node of the tree.
  • 9 is the maximum value and the rightmost node of the tree.

Therefore, to find the minimum, we can go left as much as possible and stop before we reach NULL. To find the maximum, we can go right as much as possible and stop before we reach NULL.

Minimum and maximum value in a BST
Minimum and maximum value in a BST

Let’s write the pseudocode for the getMin function. ...