public class Main {
    public static void main(String[] args) {
        AVLTree tree = new AVLTree();

        // Insert nodes
        int[] nodesToInsert = {12,5,14,3,9,13,17,0,4,11,19};
        for (int key : nodesToInsert) {
            tree.insertNode(key, 0); // Using 0 as the value for simplicity
        }

        int[] nodesToRemove = {14};
        for (int key : nodesToRemove) {
            tree.removeNode(key); // Using 0 as the value for simplicity
        }


        // Display the tree
        StringBuilder treeDisplay = display(tree);
        System.out.println(treeDisplay);
    }

    public static StringBuilder display(AVLTree tree) {
        final int height = 5, width = 64;

        int len = width * height * 2 + 2;
        StringBuilder sb = new StringBuilder(len);

        for (int i = 1; i <= len; i++)
            sb.append(i < len - 2 && i % width == 0 ? "\n" : ' ');

        displayR(sb, width / 2, 1, width / 4, width, tree.getTreeRoot(), " ");
        return sb;
    }

    private static void displayR(StringBuilder sb, int c, int r, int d, int w, AVLNode n,
                                 String edge) {
        if (n != null) {
            if (n != n.left)
                displayR(sb, c - d, r + 2, d / 2, w, n.left, " /");

            String s = String.valueOf(n.key);
            int idx1 = r * w + c - (s.length() + 1) / 2;
            int idx2 = idx1 + s.length();
            int idx3 = idx1 - w;
            if (idx2 < sb.length())
                sb.replace(idx1, idx2, s).replace(idx3, idx3 + 2, edge);

            if (n != n.right)
                displayR(sb, c + d, r + 2, d / 2, w, n.right, "\\ ");
        }
    }
}

public class Main {
    public static void main(String[] args) {
        AVLTree tree = new AVLTree();

        // Insert nodes
        int[] nodesToInsert = {12,5,14,3,9,13,17,0,4,11,19};
        for (int key : nodesToInsert) {
            tree.insertNode(key, 0); // Using 0 as the value for simplicity
        }

        int[] nodesToRemove = {14};
        for (int key : nodesToRemove) {
            tree.removeNode(key); // Using 0 as the value for simplicity
        }


        // Display the tree
        StringBuilder treeDisplay = display(tree);
        System.out.println(treeDisplay);
    }

    public static StringBuilder display(AVLTree tree) {
        final int height = 5, width = 64;

        int len = width * height * 2 + 2;
        StringBuilder sb = new StringBuilder(len);

        for (int i = 1; i <= len; i++)
            sb.append(i < len - 2 && i % width == 0 ? "\n" : ' ');

        displayR(sb, width / 2, 1, width / 4, width, tree.getTreeRoot(), " ");
        return sb;
    }

    private static void displayR(StringBuilder sb, int c, int r, int d, int w, AVLNode n,
                                 String edge) {
        if (n != null) {
            if (n != n.left)
                displayR(sb, c - d, r + 2, d / 2, w, n.left, " /");

            String s = String.valueOf(n.key);
            int idx1 = r * w + c - (s.length() + 1) / 2;
            int idx2 = idx1 + s.length();
            int idx3 = idx1 - w;
            if (idx2 < sb.length())
                sb.replace(idx1, idx2, s).replace(idx3, idx3 + 2, edge);

            if (n != n.right)
                displayR(sb, c + d, r + 2, d / 2, w, n.right, "\\ ");
        }
    }
}