下面是我寫的程式碼
可是執行出來還是有2個小錯誤
題目是要求輸入例如I4 I6 I20 D6 I10(I是Intertion 而D是Deletion)
然後利用AVL tree來印出路徑

package datastructure;
import java.io.BufferedReader;

import java.io.InputStreamReader;

public class AVL
{
public static void main(String[] args)throws Exception
{
Tree tl = new Tree();
String choice = "y";

while (choice.equalsIgnoreCase("y"))
{
System.out.println("Enter Operation you need to perform ie I-Insert and D-Delete");
System.out.println("Example - I4 means insert 4 and D4 means Delete 4 from Avl Tree");

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String input = br.readLine();

char opr = input.charAt(0);
int value = Integer.parseInt(input.substring(1, input.length()));

if(opr == 'I' || opr == 'i')
{
tl.insert(value);

}

if (opr == 'D' || opr == 'd')
{
tl.delete(value);
}
System.out.println("Tree looks like:"+tl);
System.out.println("Treedepth:"+tl.depth());
System.out.println("Want to continue(y/n)");
choice = br.readLine();
}
}
}