BinarySearchTree/leadBSTFile.java at master · sreeprasad/BinarySearchTree · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
import java.util.Iterator;
public class leadBSTFile {

	public static void main(String abc[]){

	binarySearchTree t = new binarySearchTree();
		Entree e = new Entree();
		e.setKey(new Integer(1));
		e.setValue(new Integer(2));
		e.setValue(new Integer(3));

  		long heapSize = Runtime.getRuntime().totalMemory();
		long heapMaxSize = Runtime.getRuntime().maxMemory();
		long heapFreeSize = Runtime.getRuntime().freeMemory();

		System.out.println("heap size is "+heapSize);
		System.out.println("max heap size is "+heapMaxSize);
		System.out.println("free heap size is "+heapFreeSize);

		t.addRoot(new Integer(2));

		System.out.println(t.find(new Integer(2))==null?" 2 is not present ": "2 is present in BST");
		try{
		System.out.println(t.insert(new Integer(4)) +" has been inserted");
        System.out.println(t.insert(new Integer(1)) +" has been inserted");
 		System.out.println(t.insert(new Integer(3)) +" has been inserted");

 		System.out.println(t.insert(new Integer(200)) +" has been inserted");
 		System.out.println(t.insert(new Integer(140)) +" has been inserted");
 		System.out.println(t.insert(new Integer(300)) +" has been inserted");
		/*	if(t.checkIfObjectIsPresent(new Integer(300))!=null){
		 		System.out.println((new Integer(300)) +" is present");
			}else{
				System.out.println("300 is not present");

			}
			if(t.checkIfObjectIsPresent(new Integer(1))!=null){
		 		System.out.println((new Integer(1)) +" is present");
			}else{
				System.out.println("1 is not present");
			}
				if(t.checkIfObjectIsPresent(new Integer(-400))!=null){
			 		System.out.println((new Integer(-400)) +" is present");
				}else{
					System.out.println("-400 is not present");
				}

   if(t.elementGreaterThanObject(new Integer(300))!=null){
		System.out.println("Next element  greater than  300 is "+ (Integer)t.elementGreaterThanObject(new Integer(300)));
	}else{
		System.out.println("No element is  greater than 300");
	}

	if(t.elementGreaterThanObject(new Integer(0))!=null){
		System.out.println("Next element  greater than  0 is "+ (Integer)t.elementGreaterThanObject(new Integer(0)));
	}else{
		System.out.println("No element is  greater than 0");
	}


	if(t.elementGreaterThanObject(new Integer(1))!=null){
		System.out.println("Next element  greater than  1 is "+ (Integer)t.elementGreaterThanObject(new Integer(1)));
	}else{
		System.out.println("No element is  greater than 1");
	}


	System.out.println("searching 2 here ");

	if(t.elementGreaterThanObject(new Integer(2))!=null){
		System.out.println("Next element  greater than  2 is "+ (Integer)t.elementGreaterThanObject(new Integer(2)));
	}else{
		System.out.println("No element is  greater than 2");
	}

	if(t.elementGreaterThanObject(new Integer(59))!=null){
		System.out.println("Next element  greater than  59 is "+ (Integer)t.elementGreaterThanObject(new Integer(59)));
	}else{
		System.out.println("No element is  greater than 59");
	}
	if(t.elementGreaterThanObject(new Integer(140))!=null){
		System.out.println("Next element  greater than  140 is "+ (Integer)t.elementGreaterThanObject(new Integer(140)));
	}else{
		System.out.println("No element is  greater than 140");
	}
	if(t.elementGreaterThanObject(new Integer(159))!=null){
		System.out.println("Next element  greater than  159 is "+ (Integer)t.elementGreaterThanObject(new Integer(159)));
	}else{
		System.out.println("No element is  greater than 159");
	}
	if(t.elementGreaterThanObject(new Integer(400))!=null){
		System.out.println("Next element  greater than  400 is "+ (Integer)t.elementGreaterThanObject(new Integer(400)));
	}else{
		System.out.println("No element is  greater than 400");
	}
	if(t.elementGreaterThanObject(new Integer(-400))!=null){
		System.out.println("Next element  greater than  -400 is "+ (Integer)t.elementGreaterThanObject(new Integer(-400)));
	}else{
		System.out.println("No element is  greater than -400");
	}
   		*/
System.out.println("******* before removing 300 ***********");
	Iterator ite=t.allNodes();


 		while(ite.hasNext()){
			System.out.println("element: "+ite.next());
		}


		t.removeObject(new Integer(300));
System.out.println("******* after removing 300 ***********");
				Iterator ite1=t.allNodes();


 		while(ite1.hasNext()){
			System.out.println("element: "+ite1.next());
		}

	}catch(Exception excep){
		System.out.println(excep.toString());
	}
		/*newd.insertBack(new Integer(4));
		newd.insertBack(new Integer(5));
	System.out.println(newd.ToString());*/


	}


}