class BinarySearchTree:

$"""$Binary Search Tree class.

This class represents a binary tree satisfying the Binary Search Tree

property: for every node, its value is $>=$ all items stored in its left

subtree, and $<=$ all items stored in its right subtree.

$"""$

# $===$ Private Attributes $===$

# The item stored at the root of the tree, or None if the tree is empty.

$\_$root: Optional$[$Any$]$

# The left subtree, or None if the tree is empty.

$\_$left: Optional$[$BinarySearchTree$]$

# The right subtree, or None if the tree is empty.

$\_$right: Optional$[$BinarySearchTree$]$