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

2 votes197 views2 answers
Check if jcheckbox is checked java
Java
0 vote205 views1 answer
Spring security antmatchers id
Java
0 vote210 views1 answer
Array pocket in java
Java
0 vote235 views1 answer
Log4j with spring boot restful services
Java Spring
0 vote219 views1 answer
Action bar message spigot 1.8
Java
0 vote189 views1 answer
Array de meses java
Java
0 vote205 views1 answer
Javafx check if enter pressed
Java
6 votes204 views2 answers
2d array length in java
Java
0 vote209 views2 answers
Local date to date java
Java
1 vote208 views1 answer
String into ascii in java
Java