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

1 vote215 views1 answer
Sorting hashmap by key in java 8
Java
1 vote184 views2 answers
Java array erstellen
Java
53 votes191 views5 answers
How to print array
Java
0 vote205 views2 answers
Start/php>2
Java
0 vote196 views1 answer
Alphabet n vowelin java
Java
0 vote160 views1 answer
Vec add to text field java
Java
-2 votes186 views2 answers
Change java version maven
Java
14 votes200 views1 answer
Formartted string java
Java
0 vote224 views1 answer
Spring Boot - Hashicorp Vault Integration
Java Spring
0 vote208 views1 answer
Pattern exercises for java
Java