-
Notifications
You must be signed in to change notification settings - Fork 0
/
IntegerTreeNode.java
178 lines (149 loc) · 3.58 KB
/
IntegerTreeNode.java
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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author Esha
*/
public class IntegerTreeNode {
static int count = 0;
static int Lcount = 0;
static int Rcount = 0;
int value;
IntegerTreeNode left;
IntegerTreeNode right;
public IntegerTreeNode(int value){
this.value = value;
}
public void add(int newNumber) {
if (newNumber > this.value) {
if (right == null) {
right = new IntegerTreeNode(newNumber);
} else {
right.add(newNumber);
}
} else {
if (left == null) {
left = new IntegerTreeNode(newNumber);
} else {
left.add(newNumber);
}
}
}
public boolean contains(int n) {
if (n == this.value) {
return true;
} else if (n > this.value) {
if (right == null) {
return false;
} else {
return right.contains(n);
}
} else {
if (left == null) {
return false;
} else {
return left.contains(n);
}
}
}
public int getMax(){
if (right==null) {
return this.value;
} else
return right.getMax();
}
public int getMin(){
if (left== null) {
return this.value;
} else
return left.getMin();
}
public String ToStringLeft(){
if (this.left ==null) {
String a = this.value + "L[]";
return a;
} else {
String a =" ";
a = a + "L[" +this.left.value + "]";
System.out.print(a);
return this.left.ToStringLeft();
}
}
public String ToStringRight(){
if (this.right ==null) {
String b = "R[]";
return b;
} else {
String b = "";
b = b+ "R[" + this.right.value + "]";
System.out.print(b);
return this.right.ToStringRight();
}
//System.out.print("]" );
}
public void ToString(){
System.out.print("[" + this.value);
this.ToStringLeft();
this.ToStringRight();
System.out.print("]");
}
public void ToStringAll(){
if ((this.left ==null) && (this.right ==null)){
String a = "L[] R[]";
System.out.print(a);
} else if ((this.left ==null) &&(this.right !=null)){
String a = " L[]R[" + this.right.value + "] ";
System.out.print(a);
right.ToStringAll();
} else if ((this.right ==null) &&(this.left !=null)) {
String a = " L[" + this.left.value + "R[]";
System.out.print(a);
left.ToStringAll();
}
else if ((this.right !=null) &&(this.left !=null)) {
String a = " L[" + this.left.value + "R["+ this.right.value +"] ";
System.out.print(a);
right.ToStringAll();
left.ToStringAll();
}
}
public void totalString(){
System.out.print("["+ this.value);
this.ToStringAll();
System.out.print("]");
}
public void count(){
System.out.println(count-1);
}
public void printOut(){
if (this.left ==null){
Rcount ++;
System.out.print(" L[]");
} else {
System.out.print(" L [" + this.left.value);
this.left.printOut();
System.out.print("]");
}
if (this.right ==null){
Lcount++;
System.out.print(" R[]");
} else {
System.out.print(" [R"+ this.right.value);
this.right.printOut();
System.out.print("]");
}
if (Lcount>=Rcount){
count = Lcount;
} else {
count = Rcount;
}
}
public void capturePrint(){
System.out.print("["+ this.value);
this.printOut();
System.out.print("]");
}
}