feat: add set, get methods. Add test for him

Author: RozhkovAleksandr

lib/src/main/kotlin/treelib/avlTree/AVLTree.kt

@@ -9,7 +9,7 @@ class AVLTree<K : Comparable<K>, V> :
 
     override val treeStruct = AVLStruct<Container<K, V?>>()
 
-    operator fun AVLTree<K, V>.get(key: K): V? = getItem(key)
+    operator fun set(key: K, value: V) = putItem(key to value)
 
-    operator fun AVLTree<K, V>.set(key: K, value: V) = putItem(key to value)
+    operator fun get(key: K) = getItem(key)
 }

lib/src/main/kotlin/treelib/binTree/BINTree.kt

@@ -8,7 +8,7 @@ class BINTree<K : Comparable<K>, V>
 
     override val treeStruct = BINStruct<Container<K, V?>>()
 
-    operator fun BINTree<K, V>.get(key: K): V? = getItem(key)
+    operator fun set(key: K, value: V) = putItem(key to value)
 
-    operator fun BINTree<K, V>.set(key: K, value: V) = putItem(key to value)
+    operator fun get(key: K) = getItem(key)
 }

lib/src/main/kotlin/treelib/rbTree/RBTree.kt

@@ -9,7 +9,7 @@ class RBTree<K : Comparable<K>, V> :
 
     override val treeStruct = RBStruct<Container<K, V?>>()
 
-    operator fun RBTree<K, V>.get(key: K): V? = getItem(key)
+    operator fun set(key: K, value: V) = putItem(key to value)
 
-    operator fun RBTree<K, V>.set(key: K, value: V) = putItem(key to value)
+    operator fun get(key: K) = getItem(key)
 }

lib/src/test/kotlin/treelib/AVLTreeTest.kt

@@ -1,5 +1,6 @@
 package treelib
 
+import org.junit.jupiter.api.Test
 import org.junit.jupiter.params.ParameterizedTest
 import org.junit.jupiter.params.provider.ValueSource
 import treelib.avlTree.*
@@ -80,4 +81,15 @@ class AVLTreeTest {
 
         assertEquals(expected = treeSW.getPrivateNode(treeW.getPrivateNode(tree))?.value?.key, actual = null)
     }
+
+    @Test
+    fun `test get set methods`() {
+        for (i in 1..3) {
+            tree[i] = i
+        }
+
+        assertEquals(expected = tree[1], actual = 1)
+        assertEquals(expected = tree[2], actual = 2)
+        assertEquals(expected = tree[3], actual = 3)
+    }
 }

lib/src/test/kotlin/treelib/BINTreeTest.kt

@@ -86,4 +86,30 @@ class BINTreeTest {
             actual = numbers[index + 1]
         )
     }
+
+    @Test
+    fun `test get set methods`() {
+        for (i in 1..3) {
+            tree[i] = i
+        }
+
+        assertEquals(expected = tree[1], actual = 1)
+        assertEquals(expected = tree[2], actual = 2)
+        assertEquals(expected = tree[3], actual = 3)
+    }
+
+
+    @Test
+    fun `test preorders and inorder`() {
+        val num = mutableListOf(5, 4, 6, 3, 7)
+        for (i in num) {
+            tree.putItem(Pair(i, i))
+        }
+
+        val listPreorder = tree.preOrder()
+        val listInorder = tree.inOrder()
+
+        assertEquals(listPreorder[0], Pair(5, 5))
+        assertEquals(listInorder[0], Pair(3, 3))
+    }
 }

lib/src/test/kotlin/treelib/RBTreeTest.kt

@@ -1,5 +1,6 @@
 package treelib
 
+import org.junit.jupiter.api.Test
 import org.junit.jupiter.params.ParameterizedTest
 import org.junit.jupiter.params.provider.ValueSource
 import treelib.rbTree.*
@@ -52,4 +53,15 @@ class RBTreeTest {
         assertEquals(expected = treeSW.getPrivateNode(treeW.getPrivateNode(tree))?.left?.color, actual = Markers.RED)
         assertEquals(expected = treeSW.getPrivateNode(treeW.getPrivateNode(tree))?.color, actual = Markers.BLACK)
     }
+
+    @Test
+    fun `test set method`() {
+        for (i in (1..3)) {
+            tree[i] = i
+        }
+
+        assertEquals(expected = tree[3], actual = 3)
+        assertEquals(expected = tree[2], actual = 2)
+        assertEquals(expected = tree[1], actual = 1)
+    }
 }