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 vote333 views1 answer
Android video view
Java
0 vote341 views1 answer
Gat environment variables java
Java
0 vote342 views1 answer
Your application is missing a valid safety identifier
Java
1 vote348 views1 answer
How to initialize main in java
Java
0 vote359 views1 answer
Heap sort java
Java
0 vote359 views1 answer
Resultset previous
Java
4 votes341 views6 answers
Java 8 map foreach
Java
0 vote342 views1 answer
Java replace all not number
Java
0 vote357 views1 answer
How to use user uid in android
Java
0 vote351 views1 answer
Terminate function calling in java
Java