OrderedBSTree is a BST with an additional feature of maintaining an order of elements inserted into it. It supports the following operations:
OrderedBSTree tree = new OrderedBSTree(); tree.insert(15);
tree.insert(12);
tree.insert(10);
tree.insert(29);
tree.insert(5);
tree.insert(100);
tree.insert(100);
System.out.println(tree.getMax());
System.out.println(tree.getLast());
System.out.println(tree.removeLast());
System.out.println(tree.delete(100));
System.out.println(tree.getLast());
System.out.println(tree.getMin());
System.out.println(tree.getMax());
System.out.println(tree.delete(12));
System.out.println(tree.delete(12));
System.out.println(tree.insert(10));