Introduction

• A Binary Search Tree is a special form of a binary tree
• The value in each node must be greater than (or equal to) any values in its left subtree  but less than (or equal to) any values in its right subtree

Contents

Background