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

3 votes203 views2 answers
How to get SHA fingerprint from jks file?
Java
0 vote176 views1 answer
Nth fibonacci number java using for loop
Java
0 vote230 views1 answer
Java compile
Java
0 vote171 views1 answer
Java repeat last 3 letters of string
Java
0 vote173 views1 answer
Import r android
Java
6 votes178 views1 answer
Spigot execute command as console
Java
-1 vote181 views1 answer
Testng with cucumber
Java
0 vote167 views1 answer
How to assert that an exception is thrown java
Java
0 vote202 views1 answer
Which Is Better to Configure a Spring Boot Project — Properties or YAML?
Java
0 vote190 views1 answer
Exception in Application start method java.lang.reflect.InvocationTargetException
Java