From 24655f31930437238f4ac62b143fd797a5f70b89 Mon Sep 17 00:00:00 2001 From: Adam Blank <blank@cs.washington.edu> Date: Tue, 19 Jan 2016 08:11:16 -0800 Subject: [PATCH] Updates AVLTree Class Comment --- src/datastructures/dictionaries/AVLTree.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/datastructures/dictionaries/AVLTree.java b/src/datastructures/dictionaries/AVLTree.java index cb81fbc..42d408e 100644 --- a/src/datastructures/dictionaries/AVLTree.java +++ b/src/datastructures/dictionaries/AVLTree.java @@ -6,7 +6,7 @@ import cse332.datastructures.trees.BinarySearchTree; * TODO: Replace this comment with your own as appropriate. * * AVLTree must be a subclass of BinarySearchTree<E> and must use - * inheritance and callst o superclass methodst o avoid unnecessary + * inheritance and callst o superclass methods to avoid unnecessary * duplication or copying of functionality. * * 1. Create a subclass of BSTNode, perhaps named AVLNode. @@ -24,7 +24,7 @@ import cse332.datastructures.trees.BinarySearchTree; * penalized. * 5. Cast children array to AVLNode whenever necessary in your * AVLTree. This will result a lot of casts, so we recommend you make - * private methodst hat encapsulatet hose casts. + * private methods that encapsulate those casts. * 6. Do NOT override the toString method. It is used for grading. */ -- GitLab