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 vote373 views1 answer
JFrame frame = new JFrame ();
Java
-1 vote278 views1 answer
Identify the number and its position java
Java
0 vote366 views1 answer
Java asynchronous programming example
Java
1 vote344 views1 answer
Get value of string java
Java
0 vote322 views1 answer
Java ordenar numeros ascendente
Java
0 vote298 views1 answer
How to hide complete layout in xml android studio
Java
1 vote327 views1 answer
How to maximize a web page
Java
1 vote315 views1 answer
Read Text Files in Java with BufferedReader
Java
0 vote347 views1 answer
H2 enabling remote database creation first
Java
0 vote314 views1 answer
Java Find the greatest common divisor of two positive integers. The integers can be large, so you need to find a clever solution.
Java