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 vote152 views1 answer
List of BigInteger to list of long
Java
1 vote128 views1 answer
Private properties in JavaScript ES6 classes
Java
0 vote78 views1 answer
Java socket timeout
Java
1 vote141 views1 answer
How to create search function in android studio
Java
0 vote125 views1 answer
Java thread syncronized locker
Java
4 votes115 views3 answers
While loops java
Java
0 vote129 views1 answer
Refresh sharedpreferences going back java
Java
4 votes117 views1 answer
Find the greatest number in hashmap
Java
1 vote118 views1 answer
Android run background service on startup
Java
2 votes119 views1 answer
Install java 8 on windows 10
Java