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

2 votes227 views4 answers
Sieve of eratosthenes
Java
7 votes263 views2 answers
How to return the first character in an array from a method java
Java
9 votes210 views2 answers
How to change double to int in java
Java
0 vote213 views1 answer
Key listener java
Java
0 vote247 views1 answer
Charstreams cannot be resolved
Java
0 vote179 views1 answer
How to sort 2d array in java using stream api
Java
1 vote207 views2 answers
Dialog box in java swing
Java
0 vote227 views1 answer
Algorithms - decision
Java
1 vote204 views1 answer
Return empty array from method
Java
29 votes214 views3 answers
String in java
Java