Практики 31-32

Author: l0lsi

students/23K0155/23K0155-p31/pom.xml

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+         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>23K0155</artifactId>
+        <groupId>ru.mirea.practice</groupId>
+        <version>2024.1</version>
+        <relativePath>../pom.xml</relativePath>
+    </parent>
+    <artifactId>23K0155-p31</artifactId>
+    <description>Трицать первое задание</description>
+</project>

students/23K0155/23K0155-p31/src/main/java/ru/mirea/practice/s23k0155/Node.java

@@ -0,0 +1,119 @@
+package ru.mirea.practice.s23k0155;
+
+public class Node {
+    int numberOfKeys;   // количество занятых ключей
+    int[] key = new int[3];
+    Node first;
+    Node second;
+    Node third;
+    Node fourth;
+    Node parents;   // указатель на родителей
+
+    boolean find(int k) {   // ключ находится в вершине или нет
+        for (int i = 0; i < numberOfKeys; i++) {
+            if (key[i] == k) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    void swap(int x, int y) {
+        int tempInt = x;
+        x = y;
+        y = tempInt;
+    }
+
+    void sort2(int x, int y) {
+        if (x > y) {
+            swap(x, y);
+        }
+    }
+
+    void sort3(int x, int y, int z) {
+        if (x > y) {
+            swap(x, y);
+        }
+
+        if (x > z) {
+            swap(x, y);
+        }
+
+        if (y > z) {
+            swap(y, z);
+        }
+    }
+
+    void sort() {
+        if (numberOfKeys == 2) {
+            sort2(key[0], key[1]);
+        } else if (numberOfKeys == 3) {
+            sort3(key[0], key[1], key[2]);
+        }
+    }
+
+    void addKeyInNode(int k) {
+        key[numberOfKeys] = k;
+        numberOfKeys++;
+        sort();
+    }
+
+    void deleteKeyFromNode(int k) {
+        if (numberOfKeys >= 1 && key[0] == k) {
+            key[0] = key[1];
+            key[1] = key[2];
+            numberOfKeys--;
+        } else if (numberOfKeys == 2 && key[1] == k) {
+            key[1] = key[2];
+            numberOfKeys--;
+        }
+    }
+
+    void becomeNode2(int k, Node first, Node second) {
+        key[0] = k;
+        this.first = first;
+        this.second = second;
+        this.third = null;
+        this.fourth = null;
+        this.parents = null;
+        numberOfKeys = 1;
+    }
+
+    boolean isLeaf() {
+        return first == null && second == null && third == null;
+    }
+
+    public Node(int key) {
+        numberOfKeys = 1;
+        this.key[0] = key;
+        first = null;
+        second = null;
+        third = null;
+        fourth = null;
+        parents = null;
+    }
+
+    public Node(int key, Node first, Node second, Node third, Node fourth, Node parents) {
+        numberOfKeys = 1;
+        this.key[0] = key;
+        this.first = first;
+        this.second = second;
+        this.third = third;
+        this.fourth = fourth;
+        this.parents = parents;
+    }
+
+    @Override
+    public String toString() {
+        StringBuilder sb = new StringBuilder();
+        sb.append("[");
+        for (int i = 0; i < numberOfKeys; i++) {
+            sb.append(key[i]);
+            if (i < numberOfKeys - 1) {
+                sb.append(", ");
+            }
+        }
+        sb.append("]");
+        return sb.toString();
+    }
+}

students/23K0155/23K0155-p31/src/main/java/ru/mirea/practice/s23k0155/Test.java

@@ -0,0 +1,16 @@
+package ru.mirea.practice.s23k0155;
+
+public abstract class Test {
+    public static void main(String[] args) {
+
+        TwoThreeTree tree = new TwoThreeTree();
+        tree.root = tree.insert(tree.root, 50);
+        tree.root = tree.insert(tree.root, 30);
+        tree.root = tree.insert(tree.root, 70);
+        tree.root = tree.insert(tree.root, 20);
+        tree.root = tree.insert(tree.root, 40);
+        tree.printTree();
+
+    }
+}
+