package text.java;

public class BinaryTree {
    Compareable tree = new Compareable(-1);
    Compareable head = new Compareable(-1);
    int[] a = new int[12];
    public BinaryTree()
    {
        head.setNext(tree);
    }
    public void s(int[] b)
    {
        tree.setI(b[0]);
        for(int i=1;i<b.length;i++)
        {
            Compareable c = new Compareable(b[i]);
            tree = head.getNext();
            while (tree.geti()!=b[i])
            {
                if(tree.geti()<b[i]&&(tree.getNext()!=null))
                {
                    tree = tree.getNext();
                }
                else if(tree.geti()<b[i]&&tree.getNext()==null)
                {
                    tree.setNext(c);
                    tree=c;
                }
                else  if(tree.geti()>b[i]&&tree.getSecondnext()!=null)
                    tree = tree.getSecondnext();
                else if(tree.geti()>b[i]&&tree.getSecondnext()==null)
                {
                    tree.setSecondnext(c);
                    tree = c;
                }
            }


        }

    }
    public Compareable get()
    {
        return head.getNext();
    }
}