diff --git a/src/main/java/cse332/datastructures/trees/BinarySearchTree.java b/src/main/java/cse332/datastructures/trees/BinarySearchTree.java
index 3e9410bffdd7702771eb23ee3563e50191a0cfc8..602c787c2e0cddf1d3f1de8e8cbbfdcfcc2d2bc4 100644
--- a/src/main/java/cse332/datastructures/trees/BinarySearchTree.java
+++ b/src/main/java/cse332/datastructures/trees/BinarySearchTree.java
@@ -16,6 +16,7 @@ import java.util.Iterator;
 public class BinarySearchTree<K extends Comparable<? super K>, V>
         extends ComparableDictionary<K, V> {
     // The root of the BST. Root is null if and only if the tree is empty.
+    // This MUST be used as your root for any class that extends this
     protected BSTNode root;
 
     /**