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 vote251 views1 answer
Jbutton remove selection border
Java
2 votes259 views1 answer
Spring application properties mysql jpa
Java
2 votes257 views2 answers
Install java runtime mac brew
Java
0 vote250 views1 answer
How to create object of abstract class in java
Java
0 vote265 views1 answer
Problemi arrayList javafx
Java
26 votes240 views3 answers
Java random between
Java
1 vote261 views1 answer
Reflections java
Java
-1 vote268 views1 answer
Annotation spring notnull
Java
0 vote262 views1 answer
Java stream write to file
Java
2 votes262 views2 answers
Hashmap.foreach example
Java