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 vote244 views1 answer
How to add data into list model in android
Java
0 vote256 views1 answer
Spring boot jackson infinite recursion
Java Spring
0 vote269 views1 answer
How to make a button disapear on click in javafx
Java
0 vote243 views1 answer
Bfs java
Java
0 vote254 views1 answer
AccountDriver.java
Java
13 votes183 views1 answer
All string functions in java
Java
150 votes334 views4 answers
How to scan a String in Java
Java
-1 vote251 views1 answer
Java Calender examokes
Java
0 vote237 views1 answer
Caused by: java.lang.IllegalStateException: stream has already been operated upon or closed
Java
0 vote227 views1 answer
Spring boot jackson infinite recursion
Java