public class BinTreeEncapsulatedTreeProg {
public static void main (String [] args) {
try {
SaveData dat = new SaveData ();
int i;
for (i = 0; i < args.length; i++)
dat.setData (args[i]);
dat.printData ();
}
catch (ArrayIndexOutOfBoundsException e) {
System.out.println ("usage: java BinTreeProg arg1 ...");
}
}
public static class SaveData {
BinTree root;
SaveData (String v) {
BinTree root = new BinTree (v);
}
SaveData () {
BinTree root = null;
}
void setData (String v) {
if (root == null)
root = new BinTree (v);
else
root.insertBinTree (v);
}
void printData () {
root.traverseBinTree ();
}
public static class BinTree {
public static class BinTreeNode {
BinTree l;
BinTree r;
String v;
BinTreeNode (BinTree l, BinTree r, String v) {
this.l = l;
this.r = r;
this.v = v;
}
}
BinTreeNode nod = null;
BinTree (String v) {
this.nod = new BinTreeNode (null, null, v);
}
void insertBinTree (String v) {
if (this.nod.v.compareTo (v) < 0) {
if (this.nod.l == null)
this.nod.l = new BinTree (v);
else
this.nod.l.insertBinTree (v);
}
else {
if (this.nod.r == null)
this.nod.r = new BinTree (v);
else
this.nod.r.insertBinTree (v);
}
}
void traverseBinTree () {
if (this.nod.r != null)
this.nod.r.traverseBinTree ();
System.out.println (this.nod.v);
if (this.nod.l != null)
this.nod.l.traverseBinTree ();
}
}
}
}
