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

2 votes143 views2 answers
How to find out if a directory exists in cpp
Java
0 vote133 views1 answer
How to find size of obj in java 8
Java
2 votes142 views3 answers
Design custom button in android
Java
1 vote138 views2 answers
Spring boot docker
Java
0 vote138 views1 answer
Sort a list in java according to last name
Java
2 votes175 views3 answers
Java get first day of the week
Java
0 vote145 views10 answers
Bruh
Java
1 vote151 views1 answer
Java class from string
Java
-2 votes137 views1 answer
How to import borderlayout
Java
6 votes256 views2 answers
Android array to string
Java