123

Author: Florist01

students/23K1167/23K1167-p30.part2/pom.xml

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://maven.apache.org/POM/4.0.0"
+         xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <parent>
+        <artifactId>23K1167</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K1167-p30.part2</artifactId>
+    <description>Пр </description>
+</project>

students/23K1167/23K1167-p30.part2/src/main/java/ru/mirea/practice/task1/task1/BinaryTree.java

@@ -0,0 +1,114 @@
+package ru.mirea.practice.task1.task1;
+
+public class BinaryTree {
+
+    static class Node {
+        int value;
+        Node left;
+        Node right;
+
+        public Node(int value) {
+            this.value = value;
+            left = right = null;
+        }
+    }
+
+    Node root;
+
+    public BinaryTree() {
+        root = null;
+    }
+
+    public void insert(int value) {
+        root = insertRec(root, value);
+    }
+
+    private Node insertRec(Node root, int value) {
+        if (root == null) {
+            root = new Node(value);
+            return root;
+        }
+
+        if (value < root.value) {
+            root.left = insertRec(root.left, value);
+        } else if (value > root.value) {
+            root.right = insertRec(root.right, value);
+        }
+
+        return root;
+    }
+
+    public void inorder() {
+        inorderRec(root);
+    }
+
+    private void inorderRec(Node root) {
+        if (root != null) {
+            inorderRec(root.left);
+            System.out.print(root.value + " ");
+            inorderRec(root.right);
+        }
+    }
+
+    public void delete(int value) {
+        root = deleteRec(root, value);
+    }
+
+    private Node deleteRec(Node root, int value) {
+        if (root == null) {
+            return root;
+        }
+
+        if (value < root.value) {
+            root.left = deleteRec(root.left, value);
+        } else if (value > root.value) {
+            root.right = deleteRec(root.right, value);
+        } else {
+            if (root.left == null) {
+                return root.right;
+            } else if (root.right == null) {
+                return root.left;
+            }
+
+            root.value = minValue(root.right);
+            root.right = deleteRec(root.right, root.value);
+        }
+
+        return root;
+    }
+
+    private int minValue(Node root) {
+        int minValue = root.value;
+        while (root.left != null) {
+            minValue = root.left.value;
+            root = root.left;
+        }
+        return minValue;
+    }
+
+    public void deleteTree() {
+        root = null;
+    }
+
+    public static void main(String[] args) {
+        BinaryTree tree = new BinaryTree();
+
+        int[] values = {50, 30, 20, 40, 70, 60, 80, 10, 25, 65};
+        for (int value : values) {
+            tree.insert(value);
+        }
+
+        System.out.println("Дерево до удаления узла:");
+        tree.inorder();
+        System.out.println();
+
+        tree.delete(20);
+
+        System.out.println("Дерево после удаления узла 20:");
+        tree.inorder();
+        System.out.println();
+
+        tree.deleteTree();
+        System.out.println("Дерево удалено.");
+    }
+}

students/23K1167/23K1167-p30/pom.xml

@@ -9,5 +9,5 @@
         <relativePath>../pom.xml</relativePath>
     </parent>
     <artifactId>23K1167-p30</artifactId>
-    <description>Массивы</description>
+    <description>Пр </description>
 </project>