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

1 vote116 views1 answer
Java string to charsequence
Java
1 vote152 views1 answer
Xlint:deprecation android studio
Java
1 vote171 views2 answers
Image cropper implementation
Java
11 votes186 views3 answers
Ubuntu change java version
Java
1 vote159 views1 answer
Java protected private public
Java
0 vote157 views1 answer
Private access modifiers
Java
1 vote153 views1 answer
Javax notblank not working
Java
0 vote158 views1 answer
How to change state of a Switch programmatically andoir dstudio
Java
0 vote174 views1 answer
Hangfire list recurring jobs
Java
6 votes162 views3 answers
Math.round java
Java