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

30 votes392 views6 answers
For each loop in java
Java
1 vote345 views3 answers
How to solve Caused by: java.lang.IllegalStateException: You need to use a Theme.AppCompat theme (or descendant) with this activity.
Java
0 vote354 views1 answer
Build.plugins.plugin.version
Java
0 vote358 views1 answer
Is grepper legit
Java
1 vote371 views1 answer
View binding in recyclerview adapter android java
Java
36 votes369 views4 answers
Random number in range java
Java
3 votes401 views5 answers
Java sha-256 encryption decryption example
Java
0 vote427 views1 answer
Ternary operator in java for null check
Java
6 votes415 views2 answers
Java save file
Java
1 vote375 views2 answers
What is local variable in java
Java