Comparable interface java

public class BinarySearchTree< T extends Comparable<T>> {
    Node root;
    class Node {
        T data;
        Node left;
        Node right;

        public Node(T data) {
            this.data = data;
        }
    }

    public boolean isEmpty() {
        return root == null;
    }

    public void insert(T value) {
        if(isEmpty())
            root = new Node(value);
        else
            insert(root, value);
    }

    private void insert(Node node, T value) {

        if(value.compareTo(node.data) < 0) {
            if(node.left == null)
                node.left = new Node(value);
            else
                insert(node.left, value);
        }
        else {
            if(node.right == null)
                node.right = new Node(value);
            else
                insert(node.right, value);
        }
    }

}

Source: stackoverflow.com

Similar codes

0 vote129 views1 answer
This method requires a body instead of a semicolonjava(603979883)
Java
5 votes137 views1 answer
Change color of text in textview android
Java
8 votes128 views1 answer
Alertdialog show in android
Java
0 vote140 views1 answer
Int p=10, q; switch(p) { case1: q=p*2; break; case2: q=p+2; break; case3: q=p-2; break; }
Java
0 vote129 views1 answer
Write arraylist to outputstream java byte file
Java
0 vote135 views1 answer
Libgdx load file
Java
0 vote165 views1 answer
Java como comprobar que un numero es entero?
Java
43 votes139 views5 answers
Convert string to char array in java
Java
0 vote83 views1 answer
Parcourir string java
Java
1 vote143 views1 answer
Byte to bufferedimage java
Java