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 vote297 views1 answer
Java use variables inside strings
Java
0 vote263 views1 answer
Edit activity main drawer items text color android
Java
1 vote266 views1 answer
How to change the icon of a jframe
Java
0 vote280 views1 answer
Least significant bit java
Java
0 vote315 views1 answer
Java 8 lambda comparator
Java
0 vote262 views1 answer
Fly dfguyghj: Javascript
Java
0 vote272 views1 answer
Playwright Java
Java
0 vote274 views2 answers
Java secretkey
Java
0 vote279 views1 answer
How to hash string in java
Java
1 vote267 views3 answers
Sdkman
Java