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 votes195 views2 answers
Multiplication Table in java
Java
0 vote182 views1 answer
Java check if a line is enclosed in quotation marks
Java
21 votes222 views3 answers
Java terminal colors
Java
3 votes169 views2 answers
How to convert string to double in android studio
Java
0 vote157 views1 answer
RSF
Java
0 vote171 views1 answer
Java webelement how to double click
Java
3 votes186 views2 answers
Random text generator in java
Java
0 vote143 views1 answer
Processing java screen wrap
Java
1 vote150 views2 answers
Hello world stack overflow
Java
0 vote196 views1 answer
Java project with submodules
Java