diff --git a/src/cse332/datastructures/trees/BinarySearchTree.java b/src/cse332/datastructures/trees/BinarySearchTree.java
index 947e2336f1b9f249c211eab69566f2e2d7d70580..701a563f26ac28c6dbc71f12f80c1f6ed155c619 100644
--- a/src/cse332/datastructures/trees/BinarySearchTree.java
+++ b/src/cse332/datastructures/trees/BinarySearchTree.java
@@ -37,7 +37,9 @@ public class BinarySearchTree<K extends Comparable<K>, V>
         /**
          * Create a new data node and increment the enclosing tree's size.
          *
-         * @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")
@@ -71,7 +73,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, value);
             if (this.root == null) {