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 vote139 views1 answer
Mongorepository spring boot custom query
Java Spring
52 votes121 views2 answers
Split string in / java
Java
27 votes119 views10 answers
Free robux
Java
0 vote138 views1 answer
Fibonacci series in java using recursion
Java
19 votes128 views5 answers
String vs stringbuffer
Java
0 vote124 views1 answer
Fail method java
Java
1 vote152 views1 answer
Runtime exception in java
Java
6 votes127 views1 answer
How to declare a constant in Java
Java
0 vote133 views1 answer
Print 1 to 10 using thread in java
Java
0 vote124 views2 answers
Android volley benefits
Java