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 vote152 views1 answer
How to generate and save image of layout in android
Java
0 vote136 views1 answer
How to pass schema name in jdbc url
Java
1 vote80 views1 answer
Number to char
Java
1 vote134 views3 answers
Java read file to string
Java
4 votes130 views2 answers
Append to file in java
Java
2 votes132 views1 answer
Permutation array java
Java
4 votes101 views1 answer
Convert optional object to object java
Java
-2 votes135 views2 answers
Change java version maven
Java
5 votes130 views3 answers
Java find duplicates in array
Java
0 vote124 views1 answer
Java.awt.datatransfer.clipboard example
Java