Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package binarysearchtreestuderende;
- public class App {
- public static void main(String[] args) {
- BinarySearchTree<Integer> tree1 = new BinarySearchTree<Integer>();
- tree1.add(45);
- tree1.add(77);
- tree1.add(22);
- tree1.add(11);
- tree1.add(30);
- tree1.add(90);
- tree1.add(15);
- tree1.add(25);
- tree1.add(80);
- System.out.print("FØR: ");
- tree1.print();
- System.out.print("MAX: ");
- System.out.println(tree1.findmax());
- System.out.print("Removed minimum number: ");
- System.out.println(tree1.removeMin());
- System.out.print("After removed minimum: ");
- tree1.print();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement