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 vote297 views2 answers
Java get month
Java
1 vote256 views6 answers
Roblox.com
Java
0 vote243 views1 answer
Interact with databse java
Java
0 vote235 views1 answer
Why is write replacing my text java
Java
0 vote259 views1 answer
Period java springboot
Java Spring
1 vote240 views1 answer
How to create new frame with java swing
Java
0 vote226 views1 answer
Java jackson optional
Java
0 vote235 views1 answer
Java class in dataweave
Java
0 vote239 views1 answer
Pattern using recursion in Java
Java
0 vote261 views2 answers
Void * to int
Java