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 vote307 views1 answer
Generate infinity steam java
Java
0 vote312 views1 answer
How to getobject from id in controlp5
Java
0 vote305 views2 answers
How to delete image from folder in Android programmatically
Java
-1 vote289 views3 answers
Jsonarray to list java
Java
1 vote302 views1 answer
All devisor of a number java
Java
2 votes289 views2 answers
Expected exception junit
Java
0 vote285 views1 answer
How to print all package in java
Java
6 votes240 views2 answers
Tostring java
Java
0 vote295 views1 answer
Room insert and return id
Java
8 votes289 views3 answers
Len of number in java
Java