diff --git a/src/main/java/datastructures/dictionaries/AVLTree.java b/src/main/java/datastructures/dictionaries/AVLTree.java
index 8677d00a8459ceb3d1515c8a957f389a122de3db..dce422bb4d0133f31ffb32502b2176f22ace1d81 100644
--- a/src/main/java/datastructures/dictionaries/AVLTree.java
+++ b/src/main/java/datastructures/dictionaries/AVLTree.java
@@ -19,9 +19,9 @@ import cse332.datastructures.trees.BinarySearchTree;
  * lead to highly perplexing and erroneous behavior. Instead,
  * continue using the existing BSTNode children array.
  * 4. Ensure that the class does not have redundant methods
- * 5. Cast children array to AVLNode whenever necessary in your
- * AVLTree. This will result a lot of casts, so we recommend you make
- * private methods that encapsulate those casts.
+ * 5. Cast a BSTNode to an AVLNode whenever necessary in your AVLTree.
+ * This will result a lot of casts, so we recommend you make private methods
+ * that encapsulate those casts.
  * 6. Do NOT override the toString method. It is used for grading.
  * 7. The internal structure of your AVLTree (from this.root to the leaves) must be correct
  */