Learn about Binary Search Trees!

BST Basics

BSTs work based off of a few principles:

  1. Every node has 0 to 2 leaves
  2. All values in the left subtree of a node are less than the node's value
  3. All values in the right subtree of a node are greater than the node's value

This image is a good example of a basic BST:

Check out more in this Geeks for Geeks article on the subject.

All information on this page was created by Teagan Murphy.