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 vote145 views1 answer
Rdd. map with condition
Java
0 vote165 views1 answer
Run jar with logback config file
Java
2 votes188 views2 answers
Timestamp firebase
Java
1 vote216 views1 answer
Event api spigot
Java
0 vote141 views3 answers
Number Formating in java
Java
2 votes154 views1 answer
Edittext color
Java
0 vote146 views1 answer
Junit asserttrue
Java
0 vote151 views1 answer
Java class in dataweave
Java
0 vote161 views1 answer
Arc() method from the processing library
Java
0 vote174 views1 answer
How to add element to end of array java
Java