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 vote97 views1 answer
How to concatenate string values in databinding android
Java
159 votes313 views6 answers
Java scanner
Java
1 vote152 views2 answers
How to uninstall java openjdk in linux
Java
0 vote159 views1 answer
.int x=5; final int y=7; x=x+10; y=y+10;
Java
1 vote152 views1 answer
How to create an array without knowing the size java
Java
0 vote136 views1 answer
How does minus works in Java
Java
0 vote135 views1 answer
Enlist Operations in ComboBox (Addition, Subtraction, Division, Multiplication in java
Java
0 vote143 views1 answer
Core Java tutorial
Java
0 vote173 views1 answer
Difference between ‘>>’ and ‘>>>’ operators in java
Java
1 vote140 views1 answer
Read Text Files in Java with BufferedReader
Java