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 vote277 views1 answer
Java program to find the sum of first 100 numbers
Java
4 votes270 views1 answer
Spring load config value in variable
Java
5 votes281 views4 answers
Url regular expression
Java
1 vote297 views1 answer
Strictfp java
Java
0 vote311 views2 answers
@embeddedid
Java
0 vote297 views1 answer
Java exception override message
Java
0 vote276 views1 answer
Okhttpconfig
Java
0 vote296 views1 answer
ArrayList of prime numbers
Java
-1 vote289 views1 answer
Byte array to file java
Java
0 vote284 views1 answer
How to make a text field required in android studio
Java