Add proper class description

Author: Alokxk

src/Containers-AVL-Tree-Tests/CTAVLTreeTest.class.st

@@ -1,5 +1,9 @@
 "
-An AVLTest is a test class for testing the behavior of AVL
+I test the AVL Tree implementation (CTAVLTree).
+I verify correctness of all tree operations including insertion, deletion, search, traversals, and collection protocol methods. I test edge cases like empty trees, single nodes, and complex removal scenarios.
+I ensure the AVL tree maintains both BST ordering property and AVL balance property through all operations, including automatic rebalancing via rotations.
+I test all four rotation cases and verify O(log n) height guarantees.
+
 "
 Class {
 	#name : 'CTAVLTreeTest',

src/Containers-AVL-Tree/CTAVLAbstractNode.class.st

@@ -1,16 +1,10 @@
 "
-AVLAbstractNode is an abstract class that represents a node in an AVL tree.
-
-AVL trees are self-balancing binary search trees. This abstract node class is designed to be subclassed by concrete AVL node classes. It provides common methods and instance variables that are essential for maintaining the balance of the AVL tree.
-
-Subclasses of AVLAbstractNode should implement methods for adding, removing, and manipulating nodes in the tree to ensure that the tree remains balanced.
-
+I am an abstract base class for AVL Tree nodes.
+I define the common interface that both regular nodes (CTAVLNode) and nil nodes (CTAVLNilNode) must implement.
+I include protocol for AVL-specific operations like height, balance factor, and rebalancing, as well as standard tree enumeration and searching.
 Subclasses:
-- AVLNilNode
-- AVLNode
-
-Author: Milton Mamani
-Date: October 20, 2023
+- CTAVLNilNode
+- CTAVLNode
 "
 Class {
 	#name : 'CTAVLAbstractNode',

src/Containers-AVL-Tree/CTAVLNilNode.class.st

@@ -1,10 +1,7 @@
 "
-AVLNilNode is a special sentinel node used in AVL trees to represent the absence of a node.
-
-In an AVL tree, `AVLNilNode` is used as a placeholder for null references, making it easier to perform tree operations without special cases for missing children. It fully implements the Null Object pattern.
-
-Author: Milton Mamani
-Date: October 20, 2023
+I represent an empty node in an AVL Tree using the Null Object pattern.
+I provide default 'do nothing' behavior for all tree operations, eliminating the need for nil checks throughout the tree algorithms. This makes the code cleaner and prevents null pointer errors.
+When elements are added to me, I create and return a new CTAVLNode containing the element, effectively growing the tree. I maintain height 0 and am always balanced
 "
 Class {
 	#name : 'CTAVLNilNode',

src/Containers-AVL-Tree/CTAVLNode.class.st

@@ -1,19 +1,7 @@
 "
-AVLNode represents a node in an AVL tree.
-
-An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of every node differ by at most one. The `AVLNode` class extends the `AVLAbstractNode` class and provides the implementation of actual nodes within the AVL tree.
-
-AVLNode instances hold a `contents` instance variable. These nodes are organized to keep the tree balanced, ensuring efficient operations like insertion, deletion, and search.
-
-This class should not be used directly; instead use `AVLTree`.
-
-Instance Variables:
-- contents: The value associated with this node.
-- left: The left child node.
-- right: The right child node.
-
-Author: Milton Mamani
-Date: October 20, 2023
+I represent a node in an AVL Tree.
+I extend the functionality of a standard BST node by storing my height and performing self-balancing rotations after any modification (add or remove) to ensure the tree's height balance is maintained.
+The AVL invariant I maintain is: |height(left) - height(right)| <= 1
 "
 Class {
 	#name : 'CTAVLNode',

src/Containers-AVL-Tree/CTAVLTree.class.st

@@ -1,25 +1,15 @@
 "
-AVLTree is an implementation of a self-balancing AVL (Adelson-Velsky and Landis) binary search tree.
-
-An AVL tree is a binary search tree in which the heights of the two child subtrees of every node differ by at most one. This self-balancing property ensures that the tree remains approximately balanced, leading to efficient insertion, deletion, and search operations. The instances of `AVLTree` uses AVLNode to manage the overall structure of the AVL tree =,
-
-`AVLTree` is a generic tree that can store comparable objects. It uses `AVLNode` instances to represent the nodes within the tree. 
-
+I represent an AVL Tree, a self-balancing binary search tree.
+I maintain the BST property (left < node < right) while also ensuring that the height difference between the left and right subtrees of any node is at most 1. This balancing act guarantees O(log n) worst-case performance for all primary operations.
+My public API is designed to be polymorphic with CTBinarySearchTree and includes a rich set of collection methods for enumeration, searching, and accessing.
 Usage:
-    To use `AVLTree`, create an instance of the class and then use the provided methods to insert, remove, or search for elements within the tree. The tree will automatically self-balance as elements are added or removed.
-
-Example:
-```
-| tree |
-tree := AVLTree new.
-tree add: 41.
-tree add: 87.
-tree add: 20.
-tree remove: 87.
-tree
-```
-Author: Milton
-Date: October 20, 2023
+    tree := CTAVLTree new.
+    tree addAll: #(50 30 70 20 40 60 80).
+    tree asArray. => #(20 30 40 50 60 70 80)
+    tree height. => 3
+    tree first. => 20
+    tree includes: 30. => true
+    tree elementsFrom: 30 to: 60. => #(30 40 50 60)
 "
 Class {
 	#name : 'CTAVLTree',