import java.util.Scanner; public class RedBlackTreeA { public static void main(String[] args) { Scanner scan = new Scanner(System.in); RBTree rbt = new RBTree(Integer.MIN_VALUE); char ch; do { // Deletion of Nodes is not implemented. System.out.println("Red Black Tree Operations:"); System.out.println("1. Insert "); System.out.println("2. Search"); System.out.println("3. Count Nodes"); System.out.println("4. Check Empty"); System.out.println("5. Clear Tree\n"); System.out.print("Enter Your Choice: "); int choice = scan.nextInt(); switch (choice) { case 1 : System.out.print("Enter An Integer To Insert: "); rbt.insert( scan.nextInt() ); break; case 2 : System.out.print("Enter An Integer To Search: "); System.out.println("Search Result : "+ rbt.search( scan.nextInt() )); break;