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

150 votes264 views4 answers
How to scan a String in Java
Java
0 vote166 views1 answer
Spigot change move speed of living entity creature
Java
0 vote157 views1 answer
Streamingoutput java 504 gateway timeout
Java
15 votes165 views5 answers
How to round double to 2 decimal places java
Java
-1 vote191 views3 answers
Cors spring
Java Spring
0 vote183 views4 answers
Duckduckgo
Java
0 vote172 views1 answer
Arraylistof objects
Java
3 votes176 views1 answer
More than one file was found with OS independent path 'META-INF/metadata.jvm.kotlin_module'
Java
1 vote175 views1 answer
Converting excel to csv in java
Java
0 vote173 views1 answer
Java MultipartFile not empty
Java