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 vote331 views1 answer
Comparer deux entiers java
Java
0 vote346 views1 answer
POST method) in spring rest api
Java
1 vote373 views2 answers
Remove new line in string of java
Java
0 vote300 views1 answer
How to make an activity default in android studio
Java
0 vote312 views1 answer
Android: remove shadow from bottom navigation
Java
1 vote334 views1 answer
Edittext hint color
Java
3 votes331 views2 answers
Generating a random number
Java
0 vote297 views1 answer
Alerter for java
Java
0 vote291 views1 answer
Android get app build name
Java
0 vote309 views1 answer
Remove whitespaces
Java