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

15 votes162 views6 answers
Convert array to list java
Java
0 vote169 views1 answer
Mod 10e9+7 in java
Java
29 votes189 views9 answers
Traduttore
Java
2 votes167 views1 answer
How to make java list
Java
0 vote195 views1 answer
Java decler variabel
Java
1 vote158 views1 answer
Convert string into time in java
Java
3 votes205 views1 answer
Zip file java
Java
0 vote217 views1 answer
Mostrar divisores java
Java
0 vote173 views1 answer
Spring websocket allow origin
Java
37 votes177 views4 answers
Queue in java
Java