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

24 votes287 views4 answers
Last char in string java
Java
1 vote330 views4 answers
Finding min and max from given number in java
Java
3 votes309 views1 answer
Spring bean xml configuration
Java
3 votes368 views1 answer
Android Splash Screen
Java
8 votes326 views4 answers
Get type of variable java
Java
0 vote300 views1 answer
How to encrypt password in properties file in spring boot
Java
6 votes314 views3 answers
Java get year
Java
1 vote288 views1 answer
Wat is voorbereiden voltooid deelwoord
Java
4 votes296 views1 answer
Not equal java
Java
0 vote296 views1 answer
Android studio call on a string
Java