Today, we are going to talk about Binary Search Trees!
First, we will talk about the following operations on BSTs:
1. Searching 2. Insertion 3. Deletion 4. Traversal
Then we will solve the following problems:
1. Write a method to get the minimum value in a BST. 2. Similarly, write a method to get the maximum value in a BST. 3. Write a method to determine if a binary tree is a valid BST.