/media/sda-magnetic/david/Dokumente-15/fernuni-hagen/cs-i-ii/old-cs-2-03/java-new/2020-12-18/BinTreeProg.java

public class BinTreeProg {
    public static void main (String [] args) {
        try {
            BinTree root = new BinTree (args[0]);
            int i;
            
            for (i = 1;  i < args.length;  i++)
                root.insertBinTree (args[i]);
            root.traverseBinTree ();
        }
        catch (IndexOutOfBoundsException e) {
            System.out.println ("Usage: java BinTreeProg arg1 ...");
        }
    }
    public static class BinTree {
        BinTree l;
        BinTree r;
        String v;
        
        BinTree (String v) {
            this.v = v;
            this.r = null;
            this.l = null;
        }
        void insertBinTree (String v) {
            if (this.v.compareTo (v) < 0) {
                if (this.l == null)
                    this.l = new BinTree (v);
                else
                    this.l.insertBinTree (v);
            }
            else {
                if (this.r == null)
                    this.r = new BinTree (v);
                else
                    this.r.insertBinTree (v);
            }
        }
        public void traverseBinTree () {
            if (this.r != null)
                this.r.traverseBinTree ();
            System.out.println (this.v);
            if (this.l != null)
                this.l.traverseBinTree ();
        }
    }
}