public class Program{ public static void main(String[] args) { BinaryTree bi = new BinaryTree(); int[] toBeAdded = {10, 12, 5, 15, 3, 18}; for(int i=0;i li = bi.getInOrder(); System.out.println("inOrder: "); for(int i=0;i { private ListElement start; public List(){ start = new ListEnd(); } public void add(T obj){ start = start.add(obj); } public void clear(){ start = new ListEnd(); } public T get(int index){ ListElement l = start; for(int i = 0;i { public abstract ListElement getNext(); public abstract ListElement add(T obj); public abstract T getContent(); public abstract int length(); } public class ListNode extends ListElement{ private T content; private ListElement next; public ListNode(T content, ListElement next){ this.content = content; this.next = next; } public ListElement getNext(){ return next; } public T getContent(){ return content; } public ListElement add(T obj){ next = next.add(obj); return this; } public int length(){ return 1 + next.length(); } } public class ListEnd extends ListElement{ public ListEnd(){ } public ListElement getNext(){ return this; } public T getContent(){ return null; } public ListElement add(T obj){ return new ListNode(obj, this); } public int length(){ return 0; } } public class BinaryTree { private BinaryTreeElement root; public BinaryTree(){ root = new BinaryTreeEnd(); } public void add(T obj){ root = root.add(obj); } public void clear(){ root = new BinaryTreeEnd(); } public List getInOrder(){ List li = new List(); root.addInOrder(li); return li; } public void balance(){ List li = getInOrder(); clear(); addListBalanced(li, 0, li.length()); } private void addListBalanced(List list, int start, int end) { if(start < end) { add(list.get((end-start)/2 + start)); addListBalanced(list, start, (int)(end - Math.floor(end-start)/2)); addListBalanced(list, start + (end-start)/2 + 1, end); } } public int height(){ return root.height(); } public int minHeight(){ return root.minHeight(); } public int nodes(){ return root.nodes(); } } public abstract class BinaryTreeElement { public abstract BinaryTreeElement getLeft(); public abstract BinaryTreeElement getRight(); public abstract BinaryTreeElement add(T obj); public abstract T getContent(); public abstract void addInOrder(List li); public abstract int height(); public abstract int minHeight(); public abstract int nodes(); } public class BinaryTreeNode extends BinaryTreeElement{ private T content; private BinaryTreeElement left; private BinaryTreeElement right; public BinaryTreeNode(T content, BinaryTreeElement left, BinaryTreeElement right){ this.content = content; this.left = left; this.right = right; } public BinaryTreeElement getLeft(){ return left; } public BinaryTreeElement getRight(){ return right; } public T getContent(){ return content; } public BinaryTreeElement add(T obj){ if(("" + obj).length() < ("" + content).length()){ //System.out.println("left"); left = left.add(obj); }else if(("" + obj).length() == ("" + content).length()){ if(("" + obj).compareTo("" + content) <= 0){ //System.out.println("left"); left = left.add(obj); }else{ //System.out.println("right"); right = right.add(obj); } }else{ //System.out.println("right"); right = right.add(obj); } return this; } public void addInOrder(List li){ left.addInOrder(li); li.add(content); right.addInOrder(li); } public int height(){ return Math.max(left.height(), right.height()) + 1; } public int minHeight(){ return Math.min(left.height(), right.height()) + 1; } public int nodes(){ return 1 + left.nodes() + right.nodes(); } } public class BinaryTreeEnd extends BinaryTreeElement{ public BinaryTreeEnd(){ } public BinaryTreeElement getLeft(){ return this; } public BinaryTreeElement getRight(){ return this; } public T getContent(){ return null; } public BinaryTreeElement add(T obj){ return new BinaryTreeNode(obj, this, new BinaryTreeEnd()); } public void addInOrder(List li){ } public int height(){ return 0; } public int minHeight(){ return 0; } public int nodes(){ return 0; } }

binaryTree || compositum