DemoTree3 - DemoTree3.java

// Created by Julio Tentor <jtentor@fi.unju.edu.ar>
//

import java.util.Scanner;

public class DemoTree3 {
    private static Scanner sc;

    public static void main(String[] args) {
        sc = new Scanner(System.in);
        menu();
        sc.close();
    }
    private static void menu() {
        int opcion;
        while (true) {
            System.out.print("\nOpciones:");
            System.out.print("\n  1. Agregar con Rotación Simple LL");
            System.out.print("\n  2. Agregar con Rotación Doble LR");
            System.out.print("\n  3. Remover con Rotación Simple RR");
            System.out.print("\n  4. Remover con Rotación Doble RR RL");
            System.out.print("\nSu opción (0 finaliza): ");
            opcion = sc.nextInt();
            if (opcion == 0) {
                break;
            }
            switch (opcion) {
                case 1:
                    demoadd1();
                    break;
                case 2:
                    demoadd2();
                    break;
                case 3:
                    demoremove1();
                    break;
                case 4:
                    demoremove2();
                    break;
            }
        }
    }

    private static void demoadd1() {
        System.out.print("\n\nDemo Arbol AVL Agregar con Rotación Simple LL\n");
        AVLTree<Integer> tree = new AVLTree<Integer>();
        tree.setVerbose(true);
        // Gnarled trees 29 19 50 12 22 60 8 17
        int[] numbers = {29, 19, 50, 12, 22, 60, 8, 17};
        for (int number : numbers) {
            tree.add(number);
        }
        tree.add(5);
    }
    private static void demoadd2() {
        System.out.print("\n\nDemo Arbol AVL Agregar con Rotación Doble LR\n");
        AVLTree<Integer> tree = new AVLTree<Integer>();
        tree.setVerbose(true);
        // Gnarled trees 40 20 80 10 30 50 90 45 75
        int[] numbers = {40, 20, 80, 10, 30, 50, 90, 45, 75};
        for (int number : numbers) {
            tree.add(number);
        }
        tree.add(60);
    }

    private static void demoremove1() {
        System.out.print("\n\nDemo Arbol AVL Remover con Rotación Simple RR\n");
        AVLTree<Integer> tree = new AVLTree<Integer>();
        tree.setVerbose(true);
        // Gnarled trees 29 20 61 25 40 70 55 79
        int[] numbers = {29, 20, 61, 25, 40, 70, 55, 79};
        for (int number : numbers) {
            tree.add(number);
        }
        tree.remove(25);
    }
    private static void demoremove2() {
        System.out.print("\n\nDemo Arbol AVL Remover con Rotación Doble RR RL\n");
        AVLTree<Integer> tree = new AVLTree<Integer>();
        tree.setVerbose(true);
        // Gnarled trees 70 43 90 21 58 80 110 62 72 88 95 85
        int[] numbers = {70, 43, 90, 21, 58, 80, 110, 62, 72, 88, 95, 85};
        for (int number : numbers) {
            tree.add(number);
        }
        tree.remove(21);
    }

}