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

4 votes107 views1 answer
Java.lang.illegalargumentexception: invalid character found in method name
Java
0 vote128 views1 answer
Print files in java
Java
0 vote107 views2 answers
Localtime java
Java
0 vote118 views1 answer
Webmvctest vs springboottest
Java
0 vote122 views1 answer
Convert boolean list to primitive java
Java
0 vote161 views2 answers
Remove letter from middle of string javasdript
Java
1 vote120 views1 answer
Android how to determine if the edit text focus changes
Java
3 votes152 views1 answer
Java int to biginteger
Java
0 vote110 views1 answer
Delete Specials Caractères from a String in java
Java
0 vote122 views1 answer
Flow dependency android
Java