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 vote374 views1 answer
How to convert arraylist to iterable in java
Java
3 votes325 views1 answer
How to check a integer in java
Java
0 vote356 views1 answer
How to validate information against the database in java
Java
3 votes300 views2 answers
Register listener spigot
Java
6 votes359 views3 answers
Picking a random string from string array java
Java
0 vote396 views1 answer
Wait random time java
Java
0 vote338 views1 answer
Programme javascrip mineur et majaur
Java
0 vote342 views1 answer
Foreign keys in json
Java
0 vote343 views1 answer
Java importieren
Java
15 votes381 views3 answers
How to get length of integer in java
Java