diff --git a/src/cse332/datastructures/trees/BinarySearchTree.java b/src/cse332/datastructures/trees/BinarySearchTree.java
index e5da9066bed8bd26051cea0464999d003ef5445a..e675f8ee38a9a732fb362d77b907e858879cd391 100644
--- a/src/cse332/datastructures/trees/BinarySearchTree.java
+++ b/src/cse332/datastructures/trees/BinarySearchTree.java
@@ -35,9 +35,11 @@ public class BinarySearchTree<K extends Comparable<K>, V>
         public BSTNode[] children; // The children of this node.
 
         /**
-         * Create a new data node and increment the enclosing tree's size.
+         * Create a new data node.
          *
-         * @param data
+         * @param key
+         *            key with which the specified value is to be associated
+         * @param value
          *            data element to be stored at this node.
          */
         @SuppressWarnings("unchecked")
@@ -68,7 +70,7 @@ public class BinarySearchTree<K extends Comparable<K>, V>
             }
         }
 
-        // If value is null, we need to actually add in the new value
+        // If value is not null, we need to actually add in the new value
         if (value != null) {
             current = new BSTNode(key, null);
             if (this.root == null) {