Binary Search Trees

This page is about Binary Search Trees in CS400

Some Rules To Binary Search Trees:

• A binary search tree (as covered through prerequisites of this course) is a binary tree that maintains the sorted ordering of its contents
• Each node's value is greater than or equal to all values stored in that node's left subtree
• Each node's value is less than or equal to all values stored in that node's right subtree
• At max, each nodes can only have 1 parent and 2 children

Link To Webpage With More Information:

Link to Wikipedia page (click here)