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 vote194 views1 answer
Valueof in java
Java
4 votes190 views2 answers
Java create directory if not exists
Java
0 vote200 views1 answer
Convert arraylist to csv file java
Java
0 vote210 views1 answer
Ferrari class in java
Java
0 vote187 views1 answer
Running Sum of 1d Array Leetcode
Java
1 vote194 views1 answer
React-native force rtl on android
Java
1 vote203 views2 answers
Java swing dialog box
Java
0 vote202 views1 answer
Java code to get all leaf nodes of a xml
Java
30 votes127 views10 answers
Print hello world in java
Java
4 votes246 views1 answer
Context path spring boot
Java Spring