From a87c13dc4250e7cdbc937f994577b1aaef6ab296 Mon Sep 17 00:00:00 2001
From: Arity-T <tish.mainmail@gmail.com>
Date: Mon, 3 Feb 2025 17:27:13 +0300
Subject: [PATCH] =?UTF-8?q?=D0=9F=D1=80=D0=B8=D0=B2=D1=91=D0=BB=20add=20?=
 =?UTF-8?q?=D0=B2=20MyTreeSet=20=D0=B2=20=D1=81=D0=BE=D0=BE=D1=82=D0=B2?=
 =?UTF-8?q?=D0=B5=D1=82=D1=81=D1=82=D0=B2=D0=B8=D0=B5=20=D1=81=20=D0=B8?=
 =?UTF-8?q?=D0=BD=D1=82=D0=B5=D1=80=D1=84=D0=B5=D0=B9=D1=81=D0=BE=D0=BC=20?=
 =?UTF-8?q?Set?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 lab2/src/main/java/ru/spbstu/telematics/java/App.java     | 6 +++---
 .../main/java/ru/spbstu/telematics/java/MyTreeSet.java    | 8 +++++---
 2 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/lab2/src/main/java/ru/spbstu/telematics/java/App.java b/lab2/src/main/java/ru/spbstu/telematics/java/App.java
index 175d192..261d6c7 100644
--- a/lab2/src/main/java/ru/spbstu/telematics/java/App.java
+++ b/lab2/src/main/java/ru/spbstu/telematics/java/App.java
@@ -5,8 +5,8 @@ public class App
     public static void main( String[] args )
     {
         MyTreeSet<Integer> tree = new MyTreeSet<>();
-        tree.add(10);
-        tree.add(20);
-        tree.add(5);
+        System.out.println(tree.add(10));
+        System.out.println(tree.add(20));
+        System.out.println(tree.add(10));
     }
 }
diff --git a/lab2/src/main/java/ru/spbstu/telematics/java/MyTreeSet.java b/lab2/src/main/java/ru/spbstu/telematics/java/MyTreeSet.java
index 768aee6..af0c31e 100644
--- a/lab2/src/main/java/ru/spbstu/telematics/java/MyTreeSet.java
+++ b/lab2/src/main/java/ru/spbstu/telematics/java/MyTreeSet.java
@@ -19,10 +19,10 @@ public class MyTreeSet<E extends Comparable<E>> {
         root = null;
     }
 
-    public void add(E element) {
+    public boolean add(E element) {
         if (root == null) {
             root = new Node(element);
-            return;
+            return true;
         }
 
         Node currentNode = root;
@@ -31,7 +31,7 @@ public class MyTreeSet<E extends Comparable<E>> {
         while (currentNode != null) {
             int cmp = element.compareTo(currentNode.value);
             if (cmp == 0) {
-                return;
+                return false;
             } 
             parentNode = currentNode;
             currentNode = cmp < 0 ? currentNode.left : currentNode.right;
@@ -44,5 +44,7 @@ public class MyTreeSet<E extends Comparable<E>> {
         } else {
             parentNode.right = newNode;
         }
+
+        return true;
     }
 }