package labseven.redblacktree;


import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class RBTreeDriver {

    public static void main(String[] args) {
 /*       RBTree<Integer> tree = new RBTree<>();
        System.out.println(tree.toString());

        RBNode<Integer> node = new RBNode<>(16);
        tree.insert(node);
        tree.insert(new RBNode<Integer>(10));
        tree.insert(new RBNode<Integer>(20));
        tree.insert(new RBNode<Integer>(7));
        tree.insert(new RBNode<Integer>(13));
        tree.insert(new RBNode<Integer>(18));
        tree.insert(new RBNode<Integer>(21));
        tree.insert(new RBNode<Integer>(14));
        tree.insert(new RBNode<Integer>(5));
        tree.insert(new RBNode<Integer>(3));
        tree.insert(new RBNode<Integer>(9));
        System.out.println(tree.toString());*/

        RBTree<Long> csvTree = new RBTree<>();
        Scanner scan = null;
        String line;
        String[] lineArray;
        try {
            scan = new Scanner(new File("C:\\Users\\Ajay\\Documents\\GitHub\\CS303_Algorithms\\src\\labseven\\redblacktree\\UPC.csv"));
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
        scan.useDelimiter(",");
        while (scan.hasNext()) {
            line = scan.nextLine();
            lineArray = line.split(",");
            csvTree.insert(new RBNode<>(Long.parseLong(lineArray[0]), lineArray[1], lineArray[2], null, null));
        }
        scan.close();
        RBNode<Long> node = new RBNode<>(1090L);
        System.out.println(csvTree.search(node));



    }
}

@@ -190,683 +190,8 @@
 ) %7B%0A
- /*       RBTree%3CInteger%3E tree = new RBTree%3C%3E();%0A        System.out.println(tree.toString());%0A%0A        RBNode%3CInteger%3E node = new RBNode%3C%3E(16);%0A        tree.insert(node);%0A        tree.insert(new RBNode%3CInteger%3E(10));%0A        tree.insert(new RBNode%3CInteger%3E(20));%0A        tree.insert(new RBNode%3CInteger%3E(7));%0A        tree.insert(new RBNode%3CInteger%3E(13));%0A        tree.insert(new RBNode%3CInteger%3E(18));%0A        tree.insert(new RBNode%3CInteger%3E(21));%0A        tree.insert(new RBNode%3CInteger%3E(14));%0A        tree.insert(new RBNode%3CInteger%3E(5));%0A        tree.insert(new RBNode%3CInteger%3E(3));%0A        tree.insert(new RBNode%3CInteger%3E(9));%0A        System.out.println(tree.toString());*/%0A%0A
     

Update RBTreeDriver.java