Add remaining utility methods & comprehensive edge case testing

Author: Alokxk

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

@@ -76,6 +76,35 @@ CTAVLTreeTest >> testCollect [
 	self assert: doubled asArray equals: #(40 60 80 100 140)
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testComplexRotations [
+
+	"Test more complex rotation scenarios"
+	tree addAll: #(50 30 70 20 40 60 80 10).
+	self assert: tree validate.
+	
+	"Add more elements to trigger multiple rotations"
+	tree addAll: #(5 15 25 35 45).
+	self assert: tree validate.
+	
+	"Height should remain logarithmic"
+	self assert: tree height <= 5
+]
+
+{ #category : 'tests' }
+CTAVLTreeTest >> testCopy [
+
+	| copiedTree |
+	tree addAll: #(50 30 70).
+	copiedTree := tree copy.
+	
+	self assert: copiedTree size equals: tree size.
+	self assert: copiedTree asArray equals: tree asArray.
+	copiedTree add: 99.
+	self deny: (tree includes: 99).
+	self assert: (copiedTree includes: 99)
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testDetect [
 
@@ -159,6 +188,16 @@ CTAVLTreeTest >> testEmpty [
 	self assert: tree height equals: 0
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testEmptyTreeOperations [
+
+	self assert: tree findMin isNil.
+	self assert: tree findMax isNil.
+	self deny: (tree includes: 42).
+	
+	self deny: (tree anySatisfy: [ :each | true ])
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testFindMinMax [
 
@@ -199,6 +238,18 @@ CTAVLTreeTest >> testHeight [
 	self assert: tree height equals: 2
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testIfEmptyIfNotEmpty [
+
+	| result |
+	result := tree ifEmpty: [ #empty ].
+	self assert: result equals: #empty.
+	
+	tree add: 42.
+	result := tree ifNotEmpty: [ :t | #notEmpty ].
+	self assert: result equals: #notEmpty
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testInOrderTraversal [
 
@@ -221,6 +272,17 @@ CTAVLTreeTest >> testIncludes [
 	self deny: (tree includes: 99)
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testIsLeaf [
+
+	tree add: 50.
+	self assert: tree root isLeaf.
+	
+	tree add: 30.
+	self deny: tree root isLeaf.
+	self assert: tree root left isLeaf
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testLLRotation [
 
@@ -243,6 +305,27 @@ CTAVLTreeTest >> testLRRotation [
 	self assert: tree asArray equals: #(1 2 3)
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testNegativeNumbers [
+
+	tree addAll: #(-10 -5 0 5 10).
+	
+	self assert: tree findMin equals: -10.
+	self assert: tree findMax equals: 10.
+	self assert: tree asArray equals: #(-10 -5 0 5 10).
+	self assert: tree validate
+]
+
+{ #category : 'tests' }
+CTAVLTreeTest >> testParentChildRelationships [
+
+	tree addAll: #(50 30 70 20 40).
+	
+	self assert: tree root parent isNil.
+	self assert: tree root left parent equals: tree root.
+	self assert: tree root right parent equals: tree root
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testPostOrderTraversal [
 
@@ -300,6 +383,31 @@ CTAVLTreeTest >> testRRRotation [
 	self assert: tree asArray equals: #(1 2 3)
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testRemovalCausingRebalancing [
+
+	tree addAll: #(50 30 70 20 40 60 80 10 25).
+	
+	"Remove elements that should trigger rebalancing"
+	tree remove: 10.
+	tree remove: 20.
+	tree remove: 25.
+	
+	self assert: tree validate
+]
+
+{ #category : 'tests' }
+CTAVLTreeTest >> testRemoveAll [
+
+	tree addAll: #(50 30 70 20 40).
+	tree removeAll: #(30 70).
+	
+	self assert: tree size equals: 3.
+	self deny: (tree includes: 30).
+	self deny: (tree includes: 70).
+	self assert: tree validate
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testRemoveLeafNode [
 
@@ -355,6 +463,18 @@ CTAVLTreeTest >> testRemoveRoot [
 	self assert: tree validate
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testReverseInsertions [
+
+	15 to: 1 by: -1 do: [ :i |
+		tree add: i.
+		self assert: tree validate
+	].
+	
+	self assert: tree height <= 5.
+	self assert: tree asArray equals: (1 to: 15) asArray
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testSelect [
 
@@ -365,6 +485,19 @@ CTAVLTreeTest >> testSelect [
 	self assert: evens asArray equals: #(20 30 40 50 70)
 ]
 
+{ #category : 'tests' }
+CTAVLTreeTest >> testSequentialInsertions [
+
+	"Test inserting elements in order (worst case for unbalanced BST)"
+	1 to: 15 do: [ :i |
+		tree add: i.
+		self assert: tree validate
+	].
+	
+	"Height should remain logarithmic"
+	self assert: tree height <= 5
+]
+
 { #category : 'tests' }
 CTAVLTreeTest >> testValidation [
 

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

@@ -87,6 +87,15 @@ CTAVLTree >> collect: aBlock [
 	^ result
 ]
 
+{ #category : 'copying' }
+CTAVLTree >> copy [
+
+	| newTree |
+	newTree := self class new.
+	self inOrderDo: [ :each | newTree add: each ].
+	^ newTree
+]
+
 { #category : 'enumerating' }
 CTAVLTree >> detect: aBlock ifNone: absentBlock [
 
@@ -175,6 +184,22 @@ CTAVLTree >> height [
 	^ root height
 ]
 
+{ #category : 'testing' }
+CTAVLTree >> ifEmpty: aBlock [
+
+	^ self isEmpty
+		ifTrue: [ aBlock value ]
+		ifFalse: [ self ]
+]
+
+{ #category : 'testing' }
+CTAVLTree >> ifNotEmpty: aBlock [
+
+	^ self isEmpty
+		ifFalse: [ aBlock value: self ]
+		ifTrue: [ self ]
+]
+
 { #category : 'enumerating' }
 CTAVLTree >> inOrderDo: aBlock [
 
@@ -241,6 +266,13 @@ CTAVLTree >> remove: anObject ifAbsent: aBlock [
 	^ anObject
 ]
 
+{ #category : 'removing' }
+CTAVLTree >> removeAll: aCollection [
+
+	aCollection do: [ :each | self remove: each ifAbsent: [ ] ].
+	^ aCollection
+]
+
 { #category : 'accessing' }
 CTAVLTree >> root [