Lesson 24

src/L24.java

@@ -0,0 +1,34 @@
+import utils.BinNode;
+
+public class L24 extends Main {
+
+    public static void printAll(BinNode<Integer> root) {
+        printAll(root, 0);
+    }
+
+    public static void printAll(BinNode<Integer> root, int n){
+        if (root != null) {
+            if (isLeaf(root)) {
+                System.out.println(root.getValue() + n * 10);
+            } else {
+                n = n*10 + root.getValue();
+                if (root.hasLeft()) {
+                    printAll(root.getLeft(), n);
+                }
+                if (root.hasRight()) {
+                    printAll(root.getRight(), n);
+                }
+            }
+        }
+    }
+
+
+
+    public static void main(String[] args) {
+        BinNode<Integer> root = buildTree(10);
+        printMeTree(root);
+        printAll(root);
+
+    }
+
+}

src/classes/Card.java

@@ -0,0 +1,4 @@
+package classes;
+
+public record Card(String color, int num) {
+}

src/classes/MyBaseA.java

@@ -0,0 +1,66 @@
+package classes;
+
+import utils.HelpCommands;
+import utils.Node;
+
+public class MyBaseA {
+
+    private Node<Integer> first;
+    private Node<Integer> last;
+
+    public MyBaseA() {
+        this.first = null;
+    }
+
+    public void insert(int x) {
+        if (first == null) {
+            this.first = new Node<>(x);
+        }
+        if (x > first.getValue()) {
+            this.first = new Node<>(x, this.first);
+        } else {
+            Node<Integer> temp = first;
+            while (temp.getNext() != null) {
+                if (x > temp.getNext().getValue()) {
+                    temp.setNext(new Node<>(x, temp.getNext()));
+                }
+            }
+        }
+
+        this.last = HelpCommands.getLast(first);
+    }
+
+    public boolean exists(int x) {
+        Node<Integer> temp = first;
+        while (temp != null) {
+            if (temp.getValue() == x) {
+                return true;
+            }
+            temp = temp.getNext();
+        }
+        return false;
+    }
+
+    public Node<Integer> showMin() {
+        return last;
+    }
+
+    public int getMax() {
+        int max = first.getValue();
+        this.first = first.getNext();
+        return max;
+    }
+
+    public String toString() {
+        String str = "[";
+        Node<Integer> pos = this.first;
+        while (pos != null) {
+            str = str + pos.getValue().toString();
+            if (pos.getNext() != null)
+                str = str + " , ";
+            pos = pos.getNext();
+        }
+        str = str + "]";
+        return str;
+    }
+}

src/classes/MyBaseB.java

@@ -0,0 +1,64 @@
+package classes;
+
+import utils.HelpCommands;
+import utils.Node;
+
+public class MyBaseB {
+
+    private Node<Integer> first;
+    private Node<Integer> last;
+
+    private int div7;
+
+    public MyBaseB() {
+        this.first = null;
+    }
+
+    public void insert(int x) {
+        if (x % 7 == 0) {
+            div7++;
+        }
+        if (first == null) {
+            this.first = new Node<>(x);
+        }
+        if (x > first.getValue()) {
+            this.first = new Node<>(x, this.first);
+        } else {
+            Node<Integer> temp = first;
+            while (temp.getNext() != null) {
+                if (x > temp.getNext().getValue()) {
+                    temp.setNext(new Node<>(x, temp.getNext()));
+                }
+            }
+        }
+
+        this.last = HelpCommands.getLast(first);
+    }
+
+    public int getMax() {
+        int max = first.getValue();
+        this.first = first.getNext();
+        if (max % 7 == 0) {
+            div7--;
+        }
+        return max;
+    }
+
+    public boolean div7(){
+        return div7 > 0;
+    }
+
+    public String toString() {
+        String str = "[";
+        Node<Integer> pos = this.first;
+        while (pos != null) {
+            str = str + pos.getValue().toString();
+            if (pos.getNext() != null)
+                str = str + " , ";
+            pos = pos.getNext();
+        }
+        str = str + "]";
+        return str;
+    }
+
+}

src/classes/kaufmanIsTheGoart.java

@@ -0,0 +1,12 @@
+package classes;
+
+import utils.BinNode;
+
+public void main() {
+}
+
+public static BinNode<Integer> buildTree(int[] preorder, int[] inorder) {
+    int i = 0;
+    BinNode<Integer> tree = new BinNode<>(preorder[i]);
+
+}

src/utils/HelpCommands.java

@@ -646,6 +646,20 @@ public static <T> void addLast(Node<T> node, T value) {
         node.setValue(value);
     }
 
+    public static <T> Node<T> getLast(Node<T> node){
+        while (node.getNext() != null) {
+            node = node.getNext();
+        }
+        return node;
+    }
+
+    public static <T> void setByIndex(Node<T> node, T value, int index){
+        for (int i = 0; i < index - 1; i++) {
+            node = node.getNext();
+        }
+        node.setNext(new Node<>(value, node.getNext()));
+    }
+
     public static BinNode<Integer> buildBinNode(int n) {
         BinNode<Integer> root = new BinNode<Integer>((int) (Math.random() * 99) + 1);
         BinNode<Integer> bn = root;