Binary Search Tree

For more info on binary search trees, refer to the CS400 page.

Key Features

• all nodes have a maximum of two children
• all values in a node's left subtree are less than the value in the current node
• all values in a node's right subtree are greater than the value in the current node
• if duplicate values are allowed, they can either be in the left subtree OR the right subtree